An O(1.787 n )-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes

DOI10.1007/978-3-540-74240-1_43zbMath1135.68527OpenAlexW2113446372MaRDI QIDQ5444987

Tatsuya Akutsu, Takeyuki Tamura

Publication date: 26 February 2008

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Genetics and epigenetics (92D10)

Related Items (1)

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

This page was built for publication: An O(1.787 n )-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes