Steady state analysis of Boolean molecular network models via model reduction and computational algebra

Abstract

BackgroundA key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general.ResultsThis paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author.ConclusionsThe algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate connectivity. The problem for large Boolean networks with high average connectivity remains an open problem.

Periodic Oscillations for Nonmonotonic Smooth Negative Feedback Circuits

“…Many mathematical tools have been developed for this purpose, leading to several types of modeling frameworks in Systems and Synthetic Biology ( [30,24,3,42,32]). Here we are interested in the link between continuous models (where the variations of concentrations in the molecules are represented by ordinary differential equations) and piecewise linear models as introduced by L. Glass in [14] (see [15,17,8]), where the equations combine piecewise constant production terms with linear degradation.…”

Noise-tolerant algebraic method for reconstruction of nonlinear dynamical systems

“…In recent studies, computational algebra has been exploited to theoretically reduce the number of monomials considered, and this has led to the successful reconstruction of the discrete-time finite-state PDSs of gene networks [13,22,30,31,44,46]. In [30], the complicated polynomials created by interpolating time series data were simplified by using the Gröbner basis [12] computed from the data.…”

Coupled cell networks: Boolean perspective

“…Large networks are hard to analyze mathematically, both from discrete and from continuous point of view [15], [17]. Usually in such cases a model reduction technique is applied [13], [17], [18], [19]. The authors of [1] base their model reduction strategy intended for CCNs on cell coloring.…”

“…Most methods are based on statistics, algebra, combinatorics and topology, see [9], [12], [13], [14]. We notice that a Boolean dynamical system must either have a steady state or a cycle or both; there is no possibility of oscillations and chaotic behaviors, which occur for continuous networks.…”