scholarly journals Perfect Sampling of the Master Equation for Gene Regulatory Networks

2007 ◽  
Vol 93 (2) ◽  
pp. 401-410 ◽  
Author(s):  
Martin Hemberg ◽  
Mauricio Barahona
2019 ◽  
Author(s):  
J. Holehouse ◽  
R. Grima

AbstractPropensity functions of the Hill-type are commonly used to model transcriptional regulation in stochastic models of gene expression. This leads to an effective reduced master equation for the mRNA and protein dynamics only. Based on deterministic considerations, it is often stated or tacitly assumed that such models are valid in the limit of rapid promoter switching. Here, starting from the chemical master equation describing promoter-protein interactions, mRNA transcription, protein translation and decay, we prove that in the limit of fast promoter switching, the distribution of protein numbers is different than that given by standard stochastic models with Hill-type propensities. We show the differences are pronounced whenever the protein-DNA binding rate is much larger than the unbinding rate, a special case of fast promoter switching. Furthermore we show using both theory and simulations that use of the standard stochastic models leads to drastically incorrect predictions for the switching properties of positive feedback loops and that these differences decrease with increasing mean protein burst size. Our results confirm that commonly used stochastic models of gene regulatory networks are only accurate in a subset of the parameter space consistent with rapid promoter switching.Statement of SignificanceA large number of models of gene regulatory networks in the literature assume that since promoter switching is fast then transcriptional regulation can be effectively modeled using Hill functions. While this approach can be rigorously justified for deterministic models, it is presently unclear if it is also the case for stochastic models. In this article we prove that this is not the case, i.e. stochastic models of gene regulatory systems, namely those with feedback loops, describing transcriptional regulation using Hill functions are only valid in a subset of parameter conditions consistent with fast promoter switching. We identify parameter regimes where these models are correct and where their predictions cannot be trusted.


2009 ◽  
Vol 23 (06) ◽  
pp. 773-789 ◽  
Author(s):  
OVIDIU LIPAN

Systems biology aims to describe gene regulatory networks at both experimental and theoretical levels. Mathematical formalisms used at present to describe the behavior of genetic networks range from stochastic to deterministic. The stochastic approach is further subdivided and moves from Langevin to the Master equation. This review presents the Master equation approach.


2007 ◽  
Vol 205 (2) ◽  
pp. 708-724 ◽  
Author(s):  
Markus Hegland ◽  
Conrad Burden ◽  
Lucia Santoso ◽  
Shev MacNamara ◽  
Hilary Booth

Author(s):  
Youfang Cao ◽  
Anna Terebus ◽  
Jie Liang

Stochasticity plays important roles in many biological networks. A fundamental framework for studying the full stochasticity is the Discrete Chemical Master Equation (dCME). Under this framework, the combination of copy numbers of molecular species defines the microstate of the molecular interactions in the network. The probability distribution over these microstates provide a full description of the properties of a stochastic molecular network. However, it is challenging to solve a dCME. In this chapter, we will first discuss how to derive approximation methods including Fokker-Planck equation and the chemical Langevin equation from the dCME. We also discuss the widely used stochastic simulation method. After that, we focus on the direct solutions to the dCME. We first discuss the Finite State Projection (FSP) method, and then introduce the recently developed finite buffer method (fb-dCME) for directly solving both steady state and time-evolving probability landscape of dCME. We show the advantages of the fb-dCME method using two realistic gene regulatory networks.


Sign in / Sign up

Export Citation Format

Share Document