FINDING ATTRACTORS IN ASYNCHRONOUS BOOLEAN DYNAMICS

Thomas Skodawessely and Konstantin Klemm
Additional contact information
Thomas Skodawessely: Bioinformatics Group, Institute for Computer Science, Leipzig University, Härtelstrasse 16-18, 04107 Leipzig, Germany
Konstantin Klemm: Bioinformatics Group, Institute for Computer Science, Leipzig University, Härtelstrasse 16-18, 04107 Leipzig, Germany

Advances in Complex Systems (ACS), 2011, vol. 14, issue 03, 439-449

Abstract: We present a computational method for finding attractors (ergodic sets of states) of Boolean networks under asynchronous update. The approach is based on a systematic removal of state transitions to render the state transition graph acyclic. In this reduced state transition graph, all attractors are fixed points that can be enumerated with little effort in most instances. This attractor set is then extended to the attractor set of the original dynamics. Our numerical tests on standard Kauffman networks indicate that the method is efficient in the sense that the total number of state vectors visited grows moderately with the number of states contained in attractors.

Keywords: Boolean network; attractors; algorithm (search for similar items in EconPapers)
Date: 2011
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0219525911003098
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:acsxxx:v:14:y:2011:i:03:n:s0219525911003098

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0219525911003098

Access Statistics for this article

Advances in Complex Systems (ACS) is currently edited by Frank Schweitzer

More articles in Advances in Complex Systems (ACS) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().