ADAM: Analysis of Discrete Models of Biological Systems Using Computer Algebra

Abstract

BackgroundMany 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.ResultsWe 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.ConclusionsDiscrete 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.

Multi-level Modeling of Light-Induced Stomatal Opening Offers New Insights into Its Regulation by Drought

“…Translating the model into a polynomial discrete dynamic system [98] or logical discrete model [99] would allow the use of software tools such as ADAM [100] or GINsim [99], and may yield further insights into the dynamic repertoire of the system. Our model could also be translated into a Boolean model of an expanded network, where multi-level components are represented by multiple nodes in such a way that the group of binary nodes representing the same component allows the recapitulation of the same number of relative outcomes as the original multi-level node (see e.g.…”

Control of Intracellular Molecular Networks Using Algebraic Methods

“…We also note that, in theory, computing the Gröbner basis for a system of polynomial equations can be computationally expensive (with doubly exponential complexity). However, for many biological systems, computing the Gröbner basis can be achieved in a reasonable time [18] and the computational cost does not seem to correlate with the size of the network but with the average connectivity [47].…”

Identification of control targets in Boolean molecular network models via computational algebra

“…We note that, in the worst case, computing the Gröbner basis for a system of polynomial equations has doubly exponential complexity in the number of solutions. However, for the type of networks discussed in this paper, namely, biological networks where most of the nodes are regulated by only a small subset of the other nodes, Gröbner bases can be computed in a reasonable time, see [42]. Table 2 Control nodes for the reduced T-LGL network.…”