Algorithms for Singleton Attractor Detection in Planar and Nonplanar AND/OR Boolean Networks

Abstract.Singleton attractor (also called fixed point) detection is known to be NP-hard even for AND/OR Boolean networks (AND/OR BNs in short, i.e., BNs consisting of AND/OR nodes), where 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 n is the number of nodes. In this paper, we present an O(1.757n) time algorithm with which we succeeded in improving the above algorithm. We also show that this problem can be solved in $$2^{O(({\rm log} \, n)\sqrt{n})}$$ time, which is less than O((1 + ∈)n) for any positive constant ∈, when a BN is planar.

[1]  Sui Huang.  Gene expression profiling, genetic networks, and cellular states: an integrating concept for tumorigenesis and drug discovery , 1999, Journal of Molecular Medicine.

[2]  Eric Goles,et al.  DYNAMICAL BEHAVIOR OF KAUFFMAN NETWORKS WITH AND-OR GATES , 2000 .

[3]  Akutsu Tatsuya,et al.  An O(1.787^n)-time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes , 2007 .

[4]  Daniel Rolf,et al.  Improved Bound for the PPSZ/Schöning-Algorithm for 3-SAT , 2006, J. Satisf. Boolean Model. Comput..

[5]  Tatsuya Akutsu,et al.  An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes , 2008, AB.

[6]  Kazuo Iwama,et al.  Improved upper bounds for 3-SAT , 2004, SODA '04.

[7]  Fedor V. Fomin,et al.  Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions , 2005, ESA.

[8]  Roland Somogyi,et al.  Modeling the complexity of genetic networks: Understanding multigenic and pleiotropic regulation , 1996, Complex..

[9]  L. O’Driscoll.  Gene Expression Profiling , 2011, Methods in Molecular Biology.

[10]  Predrag T. Tosic.  On the Complexity of Counting Fixed Points and Gardens of Eden in Sequential Dynamical Systems on Planar Bipartite Graphs , 2006, Int. J. Found. Comput. Sci..

[11]  B. Samuelsson,et al.  Superpolynomial growth in the number of attractors in Kauffman networks. , 2003, Physical review letters.

[12]  Giorgio Parisi,et al.  Finite size corrections to random Boolean networks , 2006 .

[13]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[14]  Andrea Roli,et al.  Solving the Satisfiability Problem through Boolean Networks , 1999, AI*IA.

[15]  A. Mochizuki.  An analytical study of the number of steady states in gene regulatory networks. , 2005, Journal of theoretical biology.

[16]  Stuart A. Kauffman,et al.  The origins of order , 1993 .

[17]  S. Kauffman,et al.  Activities and sensitivities in boolean network models. , 2004, Physical review letters.

[18]  Eric Goles Ch.,et al.  Fixed points and maximal independent sets in AND-OR networks , 2004, Discret. Appl. Math..

[19]  S. Kauffman.  Metabolic stability and epigenesis in randomly constructed genetic nets. , 1969, Journal of theoretical biology.

[20]  Edward A. Hirsch,et al.  New Worst-Case Upper Bounds for SAT , 2000, Journal of Automated Reasoning.

[21]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[22]  B. Drossel,et al.  Number and length of attractors in a critical Kauffman model with connectivity one. , 2004, Physical review letters.

[23]  Fedor V. Fomin,et al.  Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions , 2010, Algorithmica.

[24]  Akutsu,et al.  A System for Identifying Genetic Networks from Gene Expression Patterns Produced by Gene Disruptions and Overexpressions. , 1998, Genome informatics. Workshop on Genome Informatics.

[25]  Arantxa Etxeverria.  The Origins of Order , 1993 .

[26]  Albert,et al.  Dynamics of complex systems: scaling laws for the period of boolean networks , 2000, Physical review letters.

[27]  Abdul Salam Jarrah,et al.  Nested Canalyzing, Unate Cascade, and Polynomial Functions. , 2006, Physica D. Nonlinear phenomena.

[28]  Masaki Yamamoto,et al.  An Improved O(1.234m)-Time Deterministic Algorithm for SAT , 2005, ISAAC.

[29]  Carsten Peterson,et al.  Random Boolean network models and the yeast transcriptional network , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[30]  Michael K. Ng,et al.  Algorithms for Finding Small Attractors in Boolean Networks , 2007, EURASIP J. Bioinform. Syst. Biol..

[31]  Yamamoto Masaki.  An Improved (1.234m)-Time Deterministic Algorithm for SAT , 2005 .

[32]  Sven Kosub,et al.  Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems , 2008, Math. Comput. Sci..

[33]  Tatsuya Akutsu,et al.  Detecting a Singleton Attractor in a Boolean Network Utilizing SAT Algorithms , 2009, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[34]  Tatsuya Akutsu,et al.  An O(1.787n)-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes , 2007, FCT.

[35]  Satoru Miyano,et al.  Inferring qualitative relations in genetic networks and metabolic pathways , 2000, Bioinform..

[36]  L. Glass,et al.  The logical analysis of continuous, non-linear biochemical control networks. , 1973, Journal of theoretical biology.