An O(1.787n)-time algorithm for detecting a singleton attractor in a Boolean network consisting of AND/OR nodes

Authors:
Takeyuki Tamura;Tatsuya Akutsu
Affiliations:
Bioinformatics Center, Institute for Chemical Research, Kyoto University, Kyoto, Japan;Bioinformatics Center, Institute for Chemical Research, Kyoto University, Kyoto, Japan
Venue:
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Year:
2007

Citing 5
Cited 1

New Worst-Case Upper Bounds for SAT

Journal of Automated Reasoning
Solving the Satisfiability Problem through Boolean Networks

AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Improved upper bounds for 3-SAT

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for finding small attractors in boolean networks

EURASIP Journal on Bioinformatics and Systems Biology
An improved Õ(1.234m)-time deterministic algorithm for SAT

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

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

AB '08 Proceedings of the 3rd international conference on Algebraic Biology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Boolean network (BN) is a mathematical model of genetic networks. It is known that detecting a singleton attractor, which is also called a fixed point, is NP-hard even for AND/OR BNs (i.e., BNs consisting of AND/OR nodes), where singleton attractors correspond to steady states. Though a naive algorithm can detect a singleton attractor for an AND/OR BN in O(n2n) time, no O((2 - ε)n) (ε 0) time algorithm was known even for an AND/OR BN with non-restricted indegree, where n is the number of nodes in a BN. In this paper, we present an O(1.787n) time algorithm for detecting a singleton attractor of a given AND/OR BN, along with related results.