Cell Cycle Modeling for Budding Yeast with Stochastic Simulation Algorithms
Tae-Hyuk Ahn; Layne T. Watson; Yang Cao
Clifford A. Shaffer and William T. Baumann;


doi:10.3970/cmes.2009.051.027
Source CMES: Computer Modeling in Engineering & Sciences, Vol. 51, No. 1, pp. 27-52, 2009
Download Full length paper in PDF format. Size = 778,715 bytes
Keywords Stochastic simulation algorithm (SSA), cell cycle, budding yeast, parallel computing, load balancing.
Abstract For biochemical systems, where some chemical species are represented by small numbers of molecules, discrete and stochastic approaches are more appropriate than continuous and deterministic approaches. The continuous deterministic approach using ordinary differential equations is adequate for understanding the average behavior of cells, while the discrete stochastic approach accurately captures noisy events in the growth-division cycle. Since the emergence of the stochastic simulation algorithm (SSA) by Gillespie, alternative algorithms have been developed whose goal is to improve the computational efficiency of the SSA. This paper explains and empirically compares the performance of some of these SSA alternatives on a realistic model. The budding yeast cell cycle provides an excellent example of the need for modeling stochastic effects in mathematical modeling of biochemical reactions. This paper presents a stochastic approximation of the cell cycle for budding yeast using Gillespie's stochastic simulation algorithm. To compare the stochastic results with the average behavior, the simulation must be run thousands of times. A load balancing algorithm improved overall performance on a parallel supercomputer.
PDF download PDF