An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes

DOI10.1007/978-3-540-85101-1_16zbMath1171.92304OpenAlexW1541566210MaRDI QIDQ3599204

Tatsuya Akutsu, Takeyuki Tamura

Publication date: 3 February 2009

Published in: Algebraic Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85101-1_16

Mathematics Subject Classification ID

General biology and biomathematics (92B05) Computational methods for problems pertaining to biology (92-08)

Related Items (1)

Algorithms for Inference, Analysis and Control of Boolean Networks

Cites Work

• Unnamed Item
• Unnamed Item
• An analytical study of the number of steady states in gene regulatory networks
• Modeling the complexity of genetic networks: Understanding multigenic and pleiotropic regulation.
• New worst-case upper bounds for SAT
• Fixed points and maximal independent sets in AND-OR networks
• Nested canalyzing, unate cascade, and polynomial functions
• Superpolynomial Growth in the Number of Attractors in Kauffman Networks
• An O(1.787 n )-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes
• Algorithms and Computation

This page was built for publication: An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes