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

DOI10.1016/J.IPL.2010.05.001MaRDI QIDQ765479zbMATH OpenOpenAlexFDO

Authors Avraham A. Melkman, Takeyuki Tamura, Tatsuya Akutsu

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)

Cites work

• scientific article; zbMATH DE number 5604103 (Why is no real title available?)
• Algorithms and Computation
• Algorithms for singleton attractor detection in planar and nonplanar AND/OR Boolean networks
• Identification of all steady states in large networks by logical analysis
• Improving the efficiency of attractor cycle identification in Boolean networks

Cited in

(6)

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

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

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