Code for LOLCAT Method (Variant of Gillespie Algorithm)
This code and data is publicly listed code for the LOLCAT Method developed by Sagar Indurkhya and Jacob Beal, in the paper: "Reaction factoring and bipartite update graphs accelerate the Gillespie algorithm for large-scale biochemical systems."
Main Authors: | Beal, Jacob, Indurkhya, Sagar |
---|---|
Other Authors: | Gerald Sussman |
Published: |
2009
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/46710 |
Similar Items
-
Stochastic Modelling and Simulation of Free Radical Polymerization of Styrene in Microchannels using a Hybrid Gillespie Algorithm
by: Edward Uchechukwu Iwuchukwu, et al.
Published: (2023-02-01) -
Reaction Factoring and Bipartite Update Graphs Accelerate the Gillespie Algorithm for Large-Scale Biochemical Systems
by: Indurkhya, Sagar, et al.
Published: (2010) -
A comparison of computational efficiencies of stochastic algorithms in terms of two infection models
by: H. Thomas Banks, et al.
Published: (2012-06-01) -
Simulated complexes formed from a set of postsynaptic proteins suggest a localised effect of a hypomorphic Shank mutation
by: Marcell Miski, et al.
Published: (2024-07-01) -
Algorithms in computational molecular biology : techniques, approaches, and applications /
by: Elloumi, Mourad, et al.
Published: (c201)