Reaction Factoring and Bipartite Update Graphs Accelerate the Gillespie Algorithm for Large-Scale Biochemical Systems
ODE simulations of chemical systems perform poorly when some of the species have extremely low concentrations. Stochastic simulation methods, which can handle this case, have been impractical for large systems due to computational complexity. We observe, however, that when modeling complex biologica...
Main Authors: | Indurkhya, Sagar, Beal, Jacob S. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Public Library of Science
2010
|
Online Access: | http://hdl.handle.net/1721.1/55387 https://orcid.org/0000-0002-1663-5102 https://orcid.org/0000-0001-9595-252X |
Similar Items
-
Code for LOLCAT Method (Variant of Gillespie Algorithm)
by: Beal, Jacob, et al.
Published: (2009) -
Application of bipartite graphs
by: Deng, Xiaohui
Published: (2009) -
Concatenating bipartite graphs
by: Chudnovsky, M, et al.
Published: (2022) -
Joint structured bipartite graph and row-sparse projection for large-scale feature selection
by: Dong, Xia, et al.
Published: (2024) -
Irregular total labeling on complete bipartite graph and union complete bipartite graphs
by: Daoud, Jamal Ibrahim, et al.
Published: (2010)