Bayesian Sequential Inference for Stochastic Kinetic Biochemical Network Models
@article{Golightly2006BayesianSI,
title={Bayesian Sequential Inference for Stochastic Kinetic Biochemical Network Models},
author={Andrew Golightly and Darren J. Wilkinson},
journal={Journal of computational biology : a journal of computational molecular cell biology},
year={2006},
volume={13 3},
pages={
838-51
}
}As postgenomic biology becomes more predictive, the ability to infer rate parameters of genetic and biochemical networks will become increasingly important. In this paper, we explore the Bayesian estimation of stochastic kinetic rate constants governing dynamic models of intracellular processes. The underlying model is replaced by a diffusion approximation where a noise term represents intrinsic stochastic behavior and the model is identified using discrete-time (and often incomplete) data that…
109 Citations
Bayesian inference for a discretely observed stochastic kinetic model
- Computer ScienceStat. Comput.
- 2008
This paper explores how to make Bayesian inference for the kinetic rate constants of regulatory networks, using the stochastic kinetic Lotka-Volterra system as a model.
Parameter inference for stochastic kinetic models of bacterial gene regulation : a Bayesian approach to systems biology
- Biology
- 2010
The utility and addedvalue of the Bayesian approach is demonstrated in the context of a stochastic model of a key cellular decision made by the gram-positive bacterium Bacillus subtilis, using quantitative data from single-cell fluorescence microscopy and flow cytometry experiments.
Parameter estimation for biochemical reaction networks using Wasserstein distances
- Computer Science
- 2019
The effectiveness of the method is demonstrated on the three-stage model of gene expression and a genetic feedback loop for which moment-based methods are known to perform poorly.
Stochastic Modelling of Biochemical Networks and Inference of Model Parameters
- Computer Science, Biology
- 2016
This work represents the stochastic modelling approaches of biological networks and explains in details the inference of the model parameters within the Bayesian framework.
Parameter inference for discretely observed stochastic kinetic models using stochastic gradient descent
- Computer ScienceBMC Systems Biology
- 2010
The SGD method proposed in the paper presents a general framework of inferring parameters for stochastic kinetic models of biochemical reactions given discrete time-course observations of either some or all of the molecular species.
Global parameter estimation methods for stochastic biochemical systems
- BiologyBMC Bioinformatics
- 2010
Applications to three practical case studies showed that while maximum likelihood method can effectively handle low replicate measurements, the density function distance methods are more robust in estimating the parameters with consistently higher accuracy, even for systems showing multimodality.
Linking systems biology models to data: A stochastic kinetic model of p53 oscillations
- BiologyOxford Handbooks Online
- 2018
The results demonstrate that it is possible to develop computationally intensive Markov chain Monte Carlo methods for conducting a Bayesian analysis of an intra-cellular stochastic systems biology model using single-cell time course data.
A new model for kinetic parameter estimation in biochemical reactions
- Computer Science
- 2007
This work presents an alternative approach based on a probabilistic, generative model of the variations in reactant concentration, which returns the rate coefficients, the level of noise and an error range on the estimates of rate constants.
Approximate Bayesian computation for parameter inference and model selection in systems biology
- Computer Science
- 2010
This thesis presents a novel algorithm for parameter estimation and model selection of dynamical systems based on a sequential Monte Carlo framework, which gives this method a computational advantage over other existing ABC methods.
Bayesian inference for dynamic transcriptional regulation; the Hes1 system as a case study
- Computer ScienceBioinform.
- 2007
This study addresses the problem of estimating the parameters of regulatory networks and provides the first application of Markov chain Monte Carlo (MCMC) methods to experimental data and develops an estimation algorithm using MCMC techniques which are flexible enough to allow for the imputation of latent data on a finer time scale.
References
SHOWING 1-10 OF 47 REFERENCES
Bayesian inference for a discretely observed stochastic kinetic model
- Computer ScienceStat. Comput.
- 2008
This paper explores how to make Bayesian inference for the kinetic rate constants of regulatory networks, using the stochastic kinetic Lotka-Volterra system as a model.
Bayesian inference for stochastic kinetic models using a diffusion approximation.
- Computer ScienceBiometrics
- 2005
The Bayesian estimation of stochastic rate constants in the context of dynamic models of intracellular processes is concerned with the estimation of parameters in a prokaryotic autoregulatory gene network.
Bayesian inference for dynamic transcriptional regulation; the Hes1 system as a case study
- Computer ScienceBioinform.
- 2007
This study addresses the problem of estimating the parameters of regulatory networks and provides the first application of Markov chain Monte Carlo (MCMC) methods to experimental data and develops an estimation algorithm using MCMC techniques which are flexible enough to allow for the imputation of latent data on a finer time scale.
Bayesian sequential inference for nonlinear multivariate diffusions
- Mathematics, Computer ScienceStat. Comput.
- 2006
This paper adapts recently developed simulation-based sequential algorithms to the problem concerning the Bayesian analysis of discretely observed diffusion processes and applies the method to the estimation of parameters in a simple stochastic volatility model of the U.S. short-term interest rate.
Computational methods for complex stochastic systems: a review of some alternatives to MCMC
- Computer ScienceStat. Comput.
- 2008
Three alternatives to MCMC methods are reviewed, including importance sampling, the forward-backward algorithm, and sequential Monte Carlo (SMC), which are demonstrated on a range of examples, including estimating the transition density of a diffusion and of a discrete-state continuous-time Markov chain; inferring structure in population genetics; and segmenting genetic divergence data.
Dynamic conditional independence models and Markov chain Monte Carlo methods
- Computer Science
- 1997
The proposed dynamic sampling algorithms use posterior samples from previous updating stages and exploit conditional independence between groups of parameters to allow samples of parameters no longer of interest to be discarded, such as when a patient dies or is discharged.
Stochastic kinetic analysis of developmental pathway bifurcation in phage lambda-infected Escherichia coli cells.
- BiologyGenetics
- 1998
The fraction of infected cells selecting the lysogenic pathway at different phage:cell ratios, predicted using a molecular-level stochastic kinetic model of the genetic regulatory circuit, is consistent with experimental observations.
Computational modeling of genetic and biochemical networks
- Biology
- 2001
This book provides specific examples of how modeling techniques can be used to explore functionally relevant molecular and cellular relationships, applicable to cell, developmental, structural, and mathematical biology; genetics; and computational neuroscience.
Numerical Techniques for Maximum Likelihood Estimation of Continuous-Time Diffusion Processes
- Mathematics
- 2002
Stochastic differential equations often provide a convenient way to describe the dynamics of economic and financial data, and a great deal of effort has been expended searching for efficient ways to…
On inference for partially observed nonlinear diffusion models using the Metropolis–Hastings algorithm
- Mathematics, Computer Science
- 2001
A new Markov chain Monte Carlo approach to Bayesian analysis of discretely observed diffusion processes and shows that, because of full dependence between the missing paths and the volatility of the diffusion, the rate of convergence of basic algorithms can be arbitrarily slow if the amount of the augmentation is large.




