Efficient constant-time complexity algorithm for stochastic simulation of large reaction networks

Tutkimustuotos: Lehtiartikkelivertaisarvioitu

Tutkijat

Organisaatiot

  • The Microsoft Research - University of Trento Centre for Computational and Systems Biology

Kuvaus

Exact stochastic simulation is an indispensable tool for a quantitative study of biochemical reaction networks. The simulation realizes the time evolution of the model by randomly choosing a reaction to fire and update the system state according to a probability that is proportional to the reaction propensity. Two computationally expensive tasks in simulating large biochemical networks are the selection of next reaction firings and the update of reaction propensities due to state changes. We present in this work a new exact algorithm to optimize both of these simulation bottlenecks. Our algorithm employs the composition-rejection on the propensity bounds of reactions to select the next reaction firing. The selection of next reaction firings is independent of the number reactions while the update of propensities is skipped and performed only when necessary. It therefore provides a favorable scaling for the computational complexity in simulating large reaction networks. We benchmark our new algorithm with the state of the art algorithms available in literature to demonstrate its applicability and efficiency. © 2004-2012 IEEE.

Yksityiskohdat

AlkuperäiskieliEnglanti
Sivut657-667
Sivumäärä11
JulkaisuIEEE/ACM Transactions on Computational Biology and Bioinformatics
Vuosikerta14
Numero3
TilaJulkaistu - 2017
OKM-julkaisutyyppiA1 Julkaistu artikkeli, soviteltu

ID: 27839854