Show simple item record

dc.contributor.authorVeliz-Cuba, Alanen_US
dc.contributor.authorAguilar, Borisen_US
dc.contributor.authorHinkelmann, Franziskaen_US
dc.contributor.authorLaubenbacher, Reinharden_US
dc.date.accessioned2014-07-23T15:06:22Z
dc.date.available2014-07-23T15:06:22Z
dc.date.issued2014-06-26
dc.identifier.citationBMC Bioinformatics. 2014 Jun 26;15(1):221en_US
dc.identifier.urihttp://hdl.handle.net/10919/49666
dc.description.abstractBackground 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. Results 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. Conclusions 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.en_US
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.rightsCreative Commons Attribution 4.0 International*
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/*
dc.titleSteady state analysis of Boolean molecular network models via model reduction and computational algebraen_US
dc.typeArticle - Refereed
dc.date.updated2014-07-23T15:06:22Z
dc.description.versionPeer Reviewed
dc.rights.holderAlan Veliz-Cuba et al.; licensee BioMed Central Ltd.en_US
dc.title.serialBMC Bioinformatics
dc.identifier.doihttps://doi.org/10.1186/1471-2105-15-221
dc.type.dcmitypeText


Files in this item

Thumbnail
Thumbnail
Thumbnail
Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Creative Commons Attribution 4.0 International
License: Creative Commons Attribution 4.0 International