Multinomial tau-leaping method for stochastic kinetic simulations

被引:37
作者
Pettigrew, Michel F.
Resat, Haluk
机构
[1] Pacific NW Natl Lab, Computat Biol & Bioinformat Grp, Richland, WA 99352 USA
[2] Pettigrew Consulting, Edgewood, WA 98371 USA
关键词
D O I
10.1063/1.2432326
中图分类号
O64 [物理化学(理论化学)、化学物理学];
学科分类号
070304 ; 081704 ;
摘要
We introduce the multinomial tau-leaping (M tau L) method for general reaction networks with multichannel reactant dependencies. The M tau L method is an extension of the binomial tau-leaping method where efficiency is improved in several ways. First, tau-leaping steps are determined simply and efficiently using a priori information and Poisson distribution-based estimates of expectation values for reaction numbers over a tentative tau-leaping step. Second, networks are partitioned into closed groups of reactions and corresponding reactants in which no group reactant set is found in any other group. Third, product formation is factored into upper-bound estimation of the number of times a particular reaction occurs. Together, these features allow larger time steps where the numbers of reactions occurring simultaneously in a multichannel manner are estimated accurately using a multinomial distribution. Furthermore, we develop a simple procedure that places a specific upper bound on the total reaction number to ensure non-negativity of species populations over a single multiple-reaction step. Using two disparate test case problems involving cellular processes-epidermal growth factor receptor signaling and a lactose operon model-we show that the tau-leaping based methods such as the M tau L algorithm can significantly reduce the number of simulation steps thus increasing the numerical efficiency over the exact stochastic simulation algorithm by orders of magnitude. (c) 2007 American Institute of Physics.
引用
收藏
页数:15
相关论文
共 30 条
[1]  
Ander M., 2004, Systems Biology, V1, P129, DOI 10.1049/sb:20045017
[2]  
[Anonymous], 1992, MARKOV PROCESSES
[3]  
[Anonymous], 1986, Non-Uniform Random Variate Generation
[4]  
ASRATIAN AS, 1995, BIPARTITE GRAPHS THE
[5]   NEW ALGORITHM FOR MONTE-CARLO SIMULATION OF ISING SPIN SYSTEMS [J].
BORTZ, AB ;
KALOS, MH ;
LEBOWITZ, JL .
JOURNAL OF COMPUTATIONAL PHYSICS, 1975, 17 (01) :10-18
[6]   Avoiding negative populations in explicit Poisson tau-leaping [J].
Cao, Y ;
Gillespie, DT ;
Petzold, LR .
JOURNAL OF CHEMICAL PHYSICS, 2005, 123 (05)
[7]  
Cao Y, 2006, J COMPUT PHYS, V212, P6, DOI 10.1016/j.jcp.2005.06.012
[8]   Binomial distribution based τ-leap accelerated stochastic simulation -: art. no. 024112 [J].
Chatterjee, A ;
Vlachos, DG ;
Katsoulakis, MA .
JOURNAL OF CHEMICAL PHYSICS, 2005, 122 (02)
[9]   Time accelerated Monte Carlo simulations of biological networks using the binomial τ-leap method [J].
Chatterjee, A ;
Mayawala, K ;
Edwards, JS ;
Vlachos, DG .
BIOINFORMATICS, 2005, 21 (09) :2136-2137
[10]   ALGORITHM 746 - PCOMP - A FORTRAN CODE FOR AUTOMATIC DIFFERENTIATION [J].
DOBMANN, M ;
LIEPELT, M ;
SCHITTKOWSKI, K .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1995, 21 (03) :233-266