Identification of all steady states in large networks by logical analysis

✍ Scribed by Vincent Devloo; Pierre Hansen; Martine Labbé

• Publisher: Springer
• Year: 2003
• Tongue: English
• Weight: 236 KB
• Volume: 65
• Category: Article
• ISSN: 1522-9602
• DOI: 10.1016/s0092-8240(03)00061-2

✦ Synopsis

The goal of generalized logical analysis is to model complex biological systems, especially so-called regulatory systems, such as genetic networks. This theory is mainly characterized by its capacity to find all the steady states of a given system and the functional positive and negative circuits, which generate multistationarity and a cycle in the state sequence graph, respectively. So far, this has been achieved by exhaustive enumeration, which severely limits the size of the systems that can be analysed. In this paper, we introduce a mathematical function, called image function, which allows the calculation of the value of the logical parameter associated with a logical variable depending on the state of the system. Thus the state table of the system is represented analytically. We then show how all steady states can be derived as solutions to a system of steady-state equations. Constraint programming, a recent method for solving constraint satisfaction problems, is applied for that purpose. To illustrate the potential of our approach, we present results from computer experiments carried out on very large randomly-generated systems (graphs) with hundreds, or even thousands, of interacting components, and show that these systems can be solved using moderate computing time. Moreover, we illustrate the approach through two published applications, one of which concerns the computation times of all steady states for a large genetic network.