Improving the efficiency of attractor cycle identification in Boolean networks

DOI10.1016/j.physd.2006.03.006zbMath1102.37011OpenAlexW1976735018MaRDI QIDQ2495876

David James Irons

Publication date: 30 June 2006

Published in: Physica D (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physd.2006.03.006

zbMATH Keywords

cellular automataBoolean networksgenetic regulatory networkspower law degree distributions

Mathematics Subject Classification ID

Topological dynamics (37B99) Circuits, networks (94C99) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Dynamical aspects of cellular automata (37B15) Genetics and epigenetics (92D10)

Related Items (11)

Logical analysis of the budding yeast cell cycle ⋮ P\(_-\)UNSAT approach of attractor calculation for Boolean gene regulatory networks ⋮ Boolean dynamics revisited through feedback interconnections ⋮ Stability and stabilization of multivalued logical networks ⋮ Maximum number of fixed points in regulatory Boolean networks ⋮ FINDING ATTRACTORS IN ASYNCHRONOUS BOOLEAN DYNAMICS ⋮ Algorithms for Inference, Analysis and Control of Boolean Networks ⋮ An efficient approach of attractor calculation for large-scale Boolean gene regulatory networks ⋮ Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time ⋮ Fixed points and 2-cycles of synchronous dynamic coloring processes on trees ⋮ Attractors and transient in sequential dynamical systems

Cites Work

• Unnamed Item
• Boolean dynamics of networks with scale-free topology
• Effects of alternative connectivity on behavior of randomly constructed Boolean networks
• The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in \textit{Drosophila melanogaster}
• Statistical mechanics of complex networks

This page was built for publication: Improving the efficiency of attractor cycle identification in Boolean networks