Show simple item record

Code for LOLCAT Method (Variant of Gillespie Algorithm)

dc.date.accessioned2009-09-04T21:30:14Z
dc.date.accessioned2018-11-26T22:26:06Z
dc.date.available2009-09-04T21:30:14Z
dc.date.available2018-11-26T22:26:06Z
dc.date.issued2009-09-04
dc.identifier.urihttp://hdl.handle.net/1721.1/46710
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/46710
dc.description.abstractThis 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."en_US
dc.rightsCreative Commons Attrbution 3.0 Unporteden_US
dc.rights.urihttp://creativecommons.org/licenses/by/3.0/
dc.subjectComputational Systems Biologyen_US
dc.subjectGillespie Algorithmen_US
dc.subjectStochastic Simulation Algorithmen_US
dc.subjectBioinformaticsen_US
dc.titleCode for LOLCAT Method (Variant of Gillespie Algorithm)en_US


Files in this item

FilesSizeFormatView
lolcat_code.tgz43.68Mbapplication/octet-streamView/Open

This item appears in the following Collection(s)

Show simple item record

Creative Commons Attrbution 3.0 Unported
Except where otherwise noted, this item's license is described as Creative Commons Attrbution 3.0 Unported