An Efficient Steady-State Analysis Method for Large Boolean Networks with High Maximum Node Connectivity.
Ontology highlight
ABSTRACT: Boolean networks have been widely used to model biological processes lacking detailed kinetic information. Despite their simplicity, Boolean network dynamics can still capture some important features of biological systems such as stable cell phenotypes represented by steady states. For small models, steady states can be determined through exhaustive enumeration of all state transitions. As the number of nodes increases, however, the state space grows exponentially thus making it difficult to find steady states. Over the last several decades, many studies have addressed how to handle such a state space explosion. Recently, increasing attention has been paid to a satisfiability solving algorithm due to its potential scalability to handle large networks. Meanwhile, there still lies a problem
SUBMITTER: Hong C
PROVIDER: S-EPMC4700995 | biostudies-literature | 2015
REPOSITORIES: biostudies-literature
ACCESS DATA