Learn R Programming

smfsb (version 1.5)

Stochastic Modelling for Systems Biology

Description

Code and data for modelling and simulation of stochastic kinetic biochemical network models. It contains the code and data associated with the second and third editions of the book Stochastic Modelling for Systems Biology, published by Chapman & Hall/CRC Press.

Copy Link

Version

Install

install.packages('smfsb')

Monthly Downloads

176

Version

1.5

License

LGPL-3

Maintainer

Darren Wilkinson

Last Published

January 13th, 2024

Functions in smfsb (1.5)

abcSmc

Run an ABC-SMC algorithm for infering the parameters of a forward model
as.timedData

Convert a time series object to a timed data matrix
gillespie

Simulate a sample path from a stochastic kinetic model described by a stochastic Petri net
StepODE

Create a function for advancing the state of an ODE model by using the deSolve package
mcmcSummary

Summarise and plot tabular MCMC output
StepPTS

Create a function for advancing the state of an SPN by using a simple approximate Poisson time stepping method
pfMLLik1

Create a function for computing the log of an unbiased estimate of marginal likelihood of a time course data set
abcRun

Run a set of simulations initialised with parameters sampled from a given prior distribution, and compute statistics required for an ABC analaysis
rfmc

Simulate a finite state space Markov chain
gillespied

Simulate a sample path from a stochastic kinetic model described by a stochastic Petri net
rcfmc

Simulate a continuous time finite state space Markov chain
rdiff

Simulate a sample path from a univariate diffusion process
simpleEuler

Simulate a sample path from an ODE model
simTs2D

Simulate a model on a regular grid of times, using a function (closure) for advancing the state of the model
StepSDE

Create a function for advancing the state of an SDE model by using a simple Euler-Maruyama integration method
simTs

Simulate a model on a regular grid of times, using a function (closure) for advancing the state of the model
imdeath

Simulate a sample path from the homogeneous immigration-death process
stepLVc

A function for advancing the state of a Lotka-Volterra model by using the Gillespie algorithm
normgibbs

A simple Gibbs sampler for Bayesian inference for the mean and precision of a normal random sample
metropolisHastings

Run a Metropolis-Hastings MCMC algorithm for the parameters of a Bayesian posterior distribution
metrop

Run a simple Metropolis sampler with standard normal target and uniform innovations
pfMLLik

Create a function for computing the log of an unbiased estimate of marginal likelihood of a time course data set
simTs1D

Simulate a model on a regular grid of times, using a function (closure) for advancing the state of the model
mytable

Simple example data frame
smfsb-package

Stochastic Modelling for Systems Biology
simSample

Simulate a many realisations of a model at a given fixed time in the future given an initial time and state, using a function (closure) for advancing the state of the model
spnModels

Example SPN models
simTimes

Simulate a model at a specified set of times, using a function (closure) for advancing the state of the model
StepEulerSPN

Create a function for advancing the state of an SPN by using a simple continuous deterministic Euler integration method
StepGillespie

Create a function for advancing the state of an SPN by using the Gillespie algorithm
StepCLE1D

Create a function for advancing the state of an SPN by using a simple Euler-Maruyama discretisation of the CLE on a 1D regular grid
StepEuler

Create a function for advancing the state of an ODE model by using a simple Euler integration method
StepCLE

Create a function for advancing the state of an SPN by using a simple Euler-Maruyama integration method for the approximating CLE
StepFRM

Create a function for advancing the state of an SPN by using Gillespie's first reaction method
LVdata

Example simulated time courses from a stochastic Lotka--Volterra model
StepGillespie2D

Create a function for advancing the state of an SPN by using the Gillespie algorithm on a 2D regular grid
StepGillespie1D

Create a function for advancing the state of an SPN by using the Gillespie algorithm on a 1D regular grid
StepCLE2D

Create a function for advancing the state of an SPN by using a simple Euler-Maruyama discretisation of the CLE on a 2D regular grid
discretise

Discretise output from a discrete event simulation algorithm