Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time

DOI10.1016/j.ipl.2010.05.001zbMath1234.68156OpenAlexW1488563109MaRDI QIDQ765479

Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura

Publication date: 19 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.05.001

zbMATH Keywords

SATBoolean networksingleton attractor

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (6)

Synchronizing Boolean networks asynchronously ⋮ Condition for periodic attractor in 4-dimensional repressilators ⋮ Counting periodic points in parallel graph dynamical systems ⋮ Maximum number of fixed points in AND-OR-NOT networks ⋮ Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs ⋮ Singleton and 2-periodic attractors of sign-definite Boolean networks

Cites Work

• Identification of all steady states in large networks by logical analysis
• Algorithms for singleton attractor detection in planar and nonplanar AND/OR Boolean networks
• Improving the efficiency of attractor cycle identification in Boolean networks
• Algorithms and Computation
• Unnamed Item

This page was built for publication: Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time