Journal
JOURNAL OF COMPUTATIONAL BIOLOGY
Volume 16, Issue 9, Pages 1195-1208Publisher
MARY ANN LIEBERT, INC
DOI: 10.1089/cmb.2008.0249
Keywords
algorithms; evolution; statistics; stochastic processes
Categories
Funding
- NATIONAL INSTITUTE OF GENERAL MEDICAL SCIENCES [T32GM008185, R01GM053275] Funding Source: NIH RePORTER
- NATIONAL INSTITUTE OF MENTAL HEALTH [R37MH059490, R01MH059490] Funding Source: NIH RePORTER
- NIGMS NIH HHS [GM53275, GM008185] Funding Source: Medline
- NIMH NIH HHS [MH59490] Funding Source: Medline
Ask authors/readers for more resources
Stochastic simulation methods are important in modeling chemical reactions, and biological and physical stochastic processes describable as continuous-time discrete-state Markov chains with a finite number of reactant species and reactions. The current algorithm of choice, tau-leaping, achieves fast and accurate stochastic simulation by taking large time steps that leap over individual reactions. During a leap interval (t, t + tau) in tau-leaping, each reaction channel operates as a Poisson process with a constant intensity. We modify tau-leaping to allow linear and quadratic changes in reaction intensities. Because our version of tau-leaping accurately anticipates how intensities change over time, we propose calling it the step anticipation tau-leaping (SAL) algorithm. We apply SAL to four examples: Kendall's process, a two-type branching process, Ehrenfest's model of diffusion, and Michaelis-Menten enzyme kinetics. In each case, SAL is more accurate than ordinary tau-leaping. The degree of improvement varies with the situation. Near stochastic equilibrium, reaction intensities are roughly constant, and SAL and ordinary tau-leaping perform about equally well.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available