Singleton and 2-periodic attractors of sign-definite Boolean networks

DOI10.1016/J.IPL.2011.10.002zbMATH Open1233.68176OpenAlexW2081970105MaRDI QIDQ763485FDOQ763485

Takeyuki Tamura, Tatsuya Akutsu, Avraham A. Melkman

Publication date: 9 March 2012

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

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

Recommendations

• Algorithms for singleton attractor detection in planar and nonplanar AND/OR Boolean networks
• An O(1.787 n )-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes
• An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes
• Algorithms for analysis and control of Boolean networks
• Attractor separation and signed cycles in asynchronous Boolean networks

zbMATH Keywords

Boolean network2-periodic attractorsign-definite functionsingleton attractor

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Maximum number of fixed points in regulatory Boolean networks
• Sequential operator for filtering cycles in Boolean networks
• On the distribution of the number of monotone Boolean functions relative to the number of lower units
• Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time

Cited In (3)

• An O(1.787 n )-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes
• Oscillating Behavior of Logic Programs
• An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes

This page was built for publication: Singleton and 2-periodic attractors of sign-definite Boolean networks

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