Optimal enumeration of state space of finitely buffered stochastic molecular networks and exact computation of steady state landscape probability

被引:48
作者
Cao, Youfang [1 ,2 ]
Liang, Jie [1 ,3 ]
机构
[1] Shanghai Jiao Tong Univ, SCSB, Shanghai 200240, Peoples R China
[2] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai 200240, Peoples R China
[3] Univ Illinois, Dept Bioengn, Chicago, IL 60612 USA
来源
BMC SYSTEMS BIOLOGY | 2008年 / 2卷
关键词
D O I
10.1186/1752-0509-2-30
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Background: Stochasticity plays important roles in many molecular networks when molecular concentrations are in the range of 0.1 mu M to 10nM (about 100 to 10 copies in a cell). The chemical master equation provides a fundamental framework for studying these networks, and the time-varying landscape probability distribution over the full microstates, i.e., the combination of copy numbers of molecular species, provide a full characterization of the network dynamics. A complete characterization of the space of the microstates is a prerequisite for obtaining the full landscape probability distribution of a network. However, there are neither closed-form solutions nor algorithms fully describing all microstates for a given molecular network. Results: We have developed an algorithm that can exhaustively enumerate the microstates of a molecular network of small copy numbers under the condition that the net gain in newly synthesized molecules is smaller than a predefined limit. We also describe a simple method for computing the exact mean or steady state landscape probability distribution over microstates. We show how the full landscape probability for the gene networks of the self-regulating gene and the toggle-switch in the steady state can be fully characterized. We also give an example using the MAPK cascade network. Data and server will be available at URL:http://scsb.sjtu.edu.cn/statespace. Conclusion: Our algorithm works for networks of small copy numbers buffered with a finite copy number of net molecules that can be synthesized, regardless of the reaction stoichiometry, and is optimal in both storage and time complexity. The algorithm can also be used to calculate the rates of all transitions between microstates from given reactions and reaction rates. The buffer size is limited by the available memory or disk storage. Our algorithm is applicable to a class of biological networks when the copy numbers of molecules are small and the network is closed, or the network is open but the net gain in newly synthesized molecules does not exceed a predefined buffer capacity. For these networks, our method allows full stochastic characterization of the mean landscape probability distribution, and the steady state when it exists.
引用
收藏
页数:13
相关论文
共 42 条
[1]  
[Anonymous], 1997, ARPACK Users' Guide: Solution of Large Scale Eigenvalue Problems by Implicitly Restarted Arnoldi Methods, DOI 10.1137/1.9780898719628
[2]   On the existence of potential landscape in the evolution of complex systems [J].
Ao, Ping ;
Kwon, Chulan ;
Qian, Hong .
COMPLEXITY, 2007, 12 (04) :19-27
[3]  
Arkin A, 1998, GENETICS, V149, P1633
[4]   Efficient formulation of the stochastic simulation algorithm for chemically reacting systems [J].
Cao, Y ;
Li, H ;
Petzold, L .
JOURNAL OF CHEMICAL PHYSICS, 2004, 121 (09) :4059-4067
[5]  
Cormen T. H., 1990, INTRO ALGORITHMS
[6]   DOMINANT FORCES IN PROTEIN FOLDING [J].
DILL, KA .
BIOCHEMISTRY, 1990, 29 (31) :7133-7155
[7]  
DILL KA, 1995, PROTEIN SCI, V4, P561
[8]   EXACT STOCHASTIC SIMULATION OF COUPLED CHEMICAL-REACTIONS [J].
GILLESPIE, DT .
JOURNAL OF PHYSICAL CHEMISTRY, 1977, 81 (25) :2340-2361
[9]   Improved leap-size selection for accelerated stochastic simulation [J].
Gillespie, DT ;
Petzold, LR .
JOURNAL OF CHEMICAL PHYSICS, 2003, 119 (16) :8229-8234
[10]   Noise-based switches and amplifiers for gene expression [J].
Hasty, J ;
Pradines, J ;
Dolnik, M ;
Collins, JJ .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2000, 97 (05) :2075-2080