FINDING ATTRACTORS IN ASYNCHRONOUS BOOLEAN DYNAMICS
Advances in Complex Systems · 2011-06 · 14 (03) · 439-449
DOI: 10.1142/s0219525911003098 ↗Kurz gefasst
Fachartikel in der Zeitschrift Advances in Complex Systems, online erschienen am 20.11.2011. Verfasst von THOMAS SKODAWESSELY und 1 weiteren Autor:innen. Die Arbeit wurde bisher 21-mal zitiert (Crossref) und nennt 23 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
SKODAWESSELY, T., & KLEMM, K. (2011). FINDING ATTRACTORS IN ASYNCHRONOUS BOOLEAN DYNAMICS. Advances in Complex Systems, 14(03), 439-449. https://doi.org/10.1142/s0219525911003098
Vancouver
SKODAWESSELY T, KLEMM K. FINDING ATTRACTORS IN ASYNCHRONOUS BOOLEAN DYNAMICS. Advances in Complex Systems. 2011;14(03):439-449. doi:10.1142/s0219525911003098
BibTeX
@article{SKODAWESSELY2011,
author = {SKODAWESSELY, THOMAS and KLEMM, KONSTANTIN},
title = {FINDING ATTRACTORS IN ASYNCHRONOUS BOOLEAN DYNAMICS},
journal = {Advances in Complex Systems},
year = {2011},
volume = {14},
number = {03},
pages = {439--449},
doi = {10.1142/s0219525911003098}
}
EUVIMED