Search VTechWorks



Advanced Search

Browse

My Account

Statistics

Watch Registration Video

Return to Skip Menu .

Main Content

Show simple item record

dc.contributor.author Hinkelmann, Franziska
dc.contributor.author Brandon, Madison
dc.contributor.author Guang, Bonny
dc.contributor.author McNeill, Rustin
dc.contributor.author Blekherman, Grigoriy
dc.contributor.author Veliz-Cuba, Alan
dc.contributor.author Laubenbacher, Reinhard
dc.date.accessioned 2012-08-24T11:01:57Z
dc.date.available 2012-08-24T11:01:57Z
dc.date.issued 2011-07-20
dc.identifier.citation BMC Bioinformatics. 2011 Jul 20;12(1):295
dc.identifier.uri http://dx.doi.org/10.1186/1471-2105-12-295
dc.identifier.uri http://hdl.handle.net/10919/18801
dc.description.abstract Abstract Background Many biological systems are modeled qualitatively with discrete models, such as probabilistic Boolean networks, logical models, Petri nets, and agent-based models, to gain a better understanding of them. The computational complexity to analyze the complete dynamics of these models grows exponentially in the number of variables, which impedes working with complex models. There exist software tools to analyze discrete models, but they either lack the algorithmic functionality to analyze complex models deterministically or they are inaccessible to many users as they require understanding the underlying algorithm and implementation, do not have a graphical user interface, or are hard to install. Efficient analysis methods that are accessible to modelers and easy to use are needed. Results We propose a method for efficiently identifying attractors and introduce the web-based tool Analysis of Dynamic Algebraic Models (ADAM), which provides this and other analysis methods for discrete models. ADAM converts several discrete model types automatically into polynomial dynamical systems and analyzes their dynamics using tools from computer algebra. Specifically, we propose a method to identify attractors of a discrete model that is equivalent to solving a system of polynomial equations, a long-studied problem in computer algebra. Based on extensive experimentation with both discrete models arising in systems biology and randomly generated networks, we found that the algebraic algorithms presented in this manuscript are fast for systems with the structure maintained by most biological systems, namely sparseness and robustness. For a large set of published complex discrete models, ADAM identified the attractors in less than one second. Conclusions Discrete modeling techniques are a useful tool for analyzing complex biological systems and there is a need in the biological community for accessible efficient analysis tools. ADAM provides analysis methods based on mathematical algorithms as a web-based tool for several different input formats, and it makes analysis of complex models accessible to a larger community, as it is platform independent as a web-service and does not require understanding of the underlying mathematics.
dc.title ADAM: Analysis of Discrete Models of Biological Systems Using Computer Algebra
dc.type Journal Article
dc.date.updated 2012-08-24T11:01:57Z
dc.description.version Peer Reviewed
dc.language.rfc3066 en
dc.rights.holder Franziska Hinkelmann et al.; licensee BioMed Central Ltd.

Files in this item



This item appears in the following Collection(s)

Show simple item record

.