Steady state analysis of Boolean molecular network models via model reduction and computational algebra
1 Department of Mathematics, University of Houston, 651 PGH Building, Houston TX, USA
2 Department of Biochemistry and Cell Biology, Rice University, W100 George R. Brown Hall, Houston TX, USA
3 Department of Computer Science, Virginia Tech, Blacksburg VA, USA
4 TNG Technology Consulting GmbH, Unterföhring, Germany
5 Center for Quantitative Medicine, University of Connecticut Health Center and Jackson Laboratory for Genomic Medicine, Farmington CT, USA
BMC Bioinformatics 2014, 15:221 doi:10.1186/1471-2105-15-221Published: 26 June 2014
A 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.
This 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.
The 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.