Filtern
Erscheinungsjahr
- 2014 (1)
Sprache
- Englisch (1)
Schlagworte
- Boolean network (1) (entfernen)
Projekt
- A18 (1)
Anwendungsgebiet
- A (1)
Asymptotic behavior is often of particular interest when analyzing asynchronous Boolean networks representing biological systems such as signal transduction or gene regulatory networks. Methods based on a generalization of the steady state notion, the so-called symbolic steady states, can be exploited to investigate attractor properties as well as for model reduction techniques conserving attractors. In this paper, we propose a novel optimization-based method for computing all maximal symbolic steady states and motivate their use. In particular, we add a new result yielding a lower bound for the number of cyclic attractors and illustrate the methods with a short study of a MAPK pathway model.