CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2013 vol.10 Issue No.05 - Sept.-Oct.

Subscribe

Issue No.05 - Sept.-Oct. (2013 vol.10)

pp: 1125-1136

Mehmet Umut Caglar , Dept. of Phys., Texas Tech Univ., Lubbock, TX, USA

Ranadip Pal , Dept. of Phys., Texas Tech Univ., Lubbock, TX, USA

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2013.34

ABSTRACT

Probabilistic Models are regularly applied in Genetic Regulatory Network modeling to capture the stochastic behavior observed in the generation of biological entities such as mRNA or proteins. Several approaches including Stochastic Master Equations and Probabilistic Boolean Networks have been proposed to model the stochastic behavior in genetic regulatory networks. It is generally accepted that Stochastic Master Equation is a fundamental model that can describe the system being investigated in fine detail, but the application of this model is computationally enormously expensive. On the other hand, Probabilistic Boolean Network captures only the coarse-scale stochastic properties of the system without modeling the detailed interactions. We propose a new approximation of the stochastic master equation model that is able to capture the finer details of the modeled system including bistabilities and oscillatory behavior, and yet has a significantly lower computational complexity. In this new method, we represent the system using tensors and derive an identity to exploit the sparse connectivity of regulatory targets for complexity reduction. The algorithm involves an approximation based on Zassenhaus formula to represent the exponential of a sum of matrices as product of matrices. We derive upper bounds on the expected error of the proposed model distribution as compared to the stochastic master equation model distribution. Simulation results of the application of the model to four different biological benchmark systems illustrate performance comparable to detailed stochastic master equation models but with considerably lower computational complexity. The results also demonstrate the reduced complexity of the new approach as compared to commonly used Stochastic Simulation Algorithm for equivalent accuracy.

INDEX TERMS

Mathematical model, Proteins, Computational modeling, Stochastic processes, Stochastic systems, Approximation methods, Tensile stress,Differential Equation, Stochastic systems, tensors, modeling, bistability, Stochastic Master Equation

CITATION

Mehmet Umut Caglar, Ranadip Pal, "Stochastic Model Simulation Using Kronecker Product Analysis and Zassenhaus Formula Approximation",

*IEEE/ACM Transactions on Computational Biology and Bioinformatics*, vol.10, no. 5, pp. 1125-1136, Sept.-Oct. 2013, doi:10.1109/TCBB.2013.34REFERENCES

- [1] M.B. Elowitz, A.J. Levine, E.D. Siggia, and P.S. Swain, "Stochastic Gene Expression in a Single Cell,"
Science, vol. 297, no. 5584, pp. 1183-1186, 2002.- [2] A. Raj and A. van Oudenaarden, "Single-Molecule Approaches to Stochastic Gene Expression,"
Ann. Rev. Biophysics, vol. 38, no. 1, pp. 255-270, 2009.- [3] J.-P. Capp, "Stochastic Gene Expression Is the Driving Force of Cancer,"
BioEssays, vol. 33, no. 10, pp. 781-782, 2011.- [4] D.T. Gillespie, "A Rigorous Derivation of the Chemical Master Equation,"
Physica A, vol. 188, pp. 404-425, 1992.- [5] A. Arkin, J. Ross, and H.H. McAdams, "Stochastic Kinetic Analysis of Developmental Pathway Bifurcation in Phage-Infected Escherichia coli Cells,"
Genetics, vol. 149, pp. 1633-1648, 1998.- [6] H.H. McAdams and A. Arkin, "Stochastic Mechanisms in Gene Expression,"
Proc. Nat'l Academy of Sciences USA, vol. 94, pp. 814-819, 1997.- [7] B. Munsky and M. Khammash, "The Finite State Projection Algorithm for the Solution of the Chemical Master Equation,"
J. Chemical Physics, vol. 124, article 044104, 2006.- [8] C. Moler and C.V. Loan, "Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later,"
SIAM Rev., vol. 45, no. 1, pp. 3-49, 2003.- [9] N.J. Higham, "The Scaling and Squaring Method for the Matrix Exponential Revisited,"
SIAM J. Matrix Analysis Applications, vol. 26, no. 4, pp. 1179-1193, 2005.- [10] S. Kauffman,
The Origins of Order: Self-Organization and Selection in Evolution. Oxford Univ. Press, 1993.- [11] W. Magnus, "On the Exponential Solution of Differential Equations for a Linear Operator,"
Comm. Pure and Applied Math., vol. 7, pp. 649-673, 1954.- [12] R. Sridhar and R. Jagannathan, "On the Q-Analogues of the Zassenhaus Formula for Disentangling Exponential Operators,"
J. Computational Applied Math., vol. 160, nos. 1/2, pp. 297-305, Nov. 2003.- [13] H. Neudecker, "A Note on Kronecker Matrix Products and Matrix Equation Systems,"
SIAM J. Applied Math., vol. 17, no. 3, pp. 603-606, 1969.- [14] G.B. Gustafson, "Differential Equations and Linear Algebra," http://www.math.utah.edu/gustafso2250systems-de.pdf, 2012.
- [15] Y.-Y. Lin and L.-P. Hwang, "Efficient Computation of the Matrix Exponential Using Pad Approximation,"
Computers & Chemistry, vol. 16, no. 4, pp. 285-293, 1992.- [16] G.E. Cho and C.D. Meyer, "Comparison of Perturbation Bounds for the Stationary Distribution of a Markov Chain,"
Linear Algebra and Its Applications, vol. 335, pp. 137-150, 2001.- [17] P. Schweitzer, "Perturbation Theory and Finite Markov Chains,"
J. Applied Probability, vol. 5, pp. 410-413, 1968.- [18] E. Seneta, "Perturbation of the Stationary Distribution Measured by Ergodicity Coefficients,"
Advances Applied Probability, vol. 20, pp. 228-230, 1988.- [19] M. Haviv and L.V. der Heyden, "Perturbation Bounds for the Stationary Probabilities of a Finite Markov Chain,"
Advances in Applied Probability, vol. 16, pp. 804-818, 1984.- [20] R. Ware and F. Lad, "Approximating the Distribution for Sums of Products of Normal Variables," http://www.math. canterbury.ac.nz/research ucdms2003n15.pdf, 2003.
- [21] T.L. Lai and H. Robbins, "Maximally Dependent Random Variables,"
Proc. Nat'l Academy Sciences USA, vol. 73, pp. 286-288, 1976.- [22] S. Kotz and S. Nadarajah,
Extreme Value Distributions: Theory and Applications, first ed. World Scientific, 2000.- [23] C. Van Loan, "The Sensitivity of the Matrix Exponential,"
SIAM J. Numerical Analysis, vol. 14, no. 6, pp. 971-981, 1977.- [24] V.N. Vapnik,
The Nature of Statistical Learning Theory. Springer, 1998.- [25] D. Panchenko, "Course Notes of Topics in Statistics: Statistical Learning Theory," http://ocw.mit.edu/courses/mathematics/18-465-topics-in-statistics-statistical-learning-theory-spring-2007 index.htm , 2007.
- [26] M.N. Artyomov, J. Das, M. Kardar, and A.K. Chakraborty, "Purely Stochastic Binary Decisions in Cell Signaling Models without Underlying Deterministic Bistabilities,"
Proc. Nat'l Academy of Sciences USA, vol. 104, no. 48, pp. 18958-18963, 2007.- [27] M. Hegland, C. Burden, L. Santoso, S. MacNamara, and H. Booth, "A Solver for the Stochastic Master Equation Applied to Gene Regulatory Networks,"
J. Computational and Applied Math., vol. 205, no. 2, pp. 708-724, 2007.- [28] A. Loinger and O. Biham, "Stochastic Simulations of the Repressilator Circuit,"
Physics Rev. E, vol. 76, article 051917, 2007.- [29] T. Jahnke and W. Huisinga, "A Dynamical Low-Rank Approach to the Chemical Master Equation,"
Bull. Math. Biology, vol. 70, pp. 2283-2302, 2008. |