ADAM: analysis of discrete models of biological systems using computer algebra. 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.
Keywords for this software
References in zbMATH (referenced in 8 articles )
Showing results 1 to 8 of 8.
- Sordo Vieira, Luis; Laubenbacher, Reinhard C.; Murrugarra, David: Control of intracellular molecular networks using algebraic methods (2020)
- Menini, Laura; Possieri, Corrado; Tornambè, Antonio: Boolean network analysis through the joint use of linear algebra and algebraic geometry (2019)
- Jenkins, Andy; Macauley, Matthew: Bistability and asynchrony in a Boolean model of the \textscL-arabinose operon in \textitEscherichiacoli (2017)
- Possieri, Corrado; Teel, Andrew R.: Asymptotic stability in probability for stochastic Boolean networks (2017)
- Dinwoodie, Ian H.: Computational methods for asynchronous basins (2016)
- Veliz-Cuba, Alan; Aguilar, Boris; Laubenbacher, Reinhard: Dimension reduction of large sparse AND-NOT network models (2015)
- Laubenbacher, Reinhard; Hinkelmann, Franziska; Murrugarra, David; Veliz-Cuba, Alan: Algebraic models and their use in systems biology (2014)
- Veliz-Cuba, Alan: Reduction of Boolean network models (2011)