Improving the efficiency of attractor cycle identification in Boolean networks

DOI10.1016/J.PHYSD.2006.03.006MaRDI QIDQ2495876zbMATH OpenOpenAlexFDO

Authors 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

Boolean networkscellular automatagenetic regulatory networkspower law degree distributions

Mathematics Subject Classification ID

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

Recommendations

• Identification of predictors of Boolean networks from observed attractor states
• An efficient approach of attractor calculation for large-scale Boolean gene regulatory networks
• Optimising attractor computation in Boolean automata networks
• An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes
• Discrimination of singleton and periodic attractors in Boolean networks
• Attractors in Boolean networks: a tutorial
• Attractor separation and signed cycles in asynchronous Boolean networks

Cites work

• Boolean dynamics of networks with scale-free topology
• Effects of alternative connectivity on behavior of randomly constructed Boolean networks
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• Statistical mechanics of complex networks
• The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in \textit{Drosophila melanogaster}

Cited in

(14)

• Logical analysis of the budding yeast cell cycle
• P\(_-\)UNSAT approach of attractor calculation for Boolean gene regulatory networks
• Fixed points and 2-cycles of synchronous dynamic coloring processes on trees
• Optimising attractor computation in Boolean automata networks
• Finding attractors in asynchronous Boolean dynamics
• Algorithms for Inference, Analysis and Control of Boolean Networks
• Attractors and transient in sequential dynamical systems
• Identification of predictors of Boolean networks from observed attractor states
• Boolean dynamics revisited through feedback interconnections
• Counting fixed points and pure 2-cycles of tree cellular automata
• Stability and stabilization of multivalued logical 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
• Maximum number of fixed points in regulatory Boolean networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2495876)