An Improved 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 611-0011;Bioinformatics Center, Institute for Chemical Research, Kyoto University, Kyoto, Japan 611-0011
Venue:
AB '08 Proceedings of the 3rd international conference on Algebraic Biology
Year:
2008

Citing 7
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
Fixed points and maximal independent sets in AND-OR networks

Discrete Applied Mathematics
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 O(1.787n)-time algorithm for detecting a singleton attractor in a Boolean network consisting of AND/OR nodes

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory

Algorithms for Inference, Analysis and Control of Boolean Networks

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Detection of a singleton attractor, which is also called a fixed point, is known to be NP-hard even for AND/OR BNs (i.e., BNs consisting of AND/OR nodes), where the Boolean network (BN) is a mathematical model of genetic networks and singleton attractors correspond to steady states. In our recent paper, we developed an O(1.787n) time algorithm for detecting a singleton attractor of a given AND/OR BN where nis the number of nodes. In this paper, we present an O(1.757n) time algorithm with which we succeeded in improving the above algorithm.