Analyses and Algorithms for Predecessor and Control Problems for Boolean Networks of Bounded Indegree (IPSJ Transactions on Bioinformatics Vol.1)

We study the predecessor and control problems for Boolean networks (BNs). The predecessor problem is to determine whether there exists a global state that transits to a given global state in a given BN, and the control problem is to find a sequence of 0-1 vectors for control nodes in a given BN which leads the BN to a desired global state. The predecessor problem is useful both for the control problem for BNs and for analysis of landscape of basins of attractions in BNs. In this paper, we focus on BNs of bounded indegree and show some hardness results on the computational complexity of the predecessor and control problems. We also present simple algorithms for the predecessor problem that are much faster than the naive exhaustive search-based algorithm. Furthermore, we show some results on distribution of predecessors, which leads to an improved algorithm for the control problem for BNs of bounded indegree.

[1]  Martine Labbé,et al.  Identification of all steady states in large networks by logical analysis , 2003, Bulletin of mathematical biology.

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

[3]  D. Irons.  Improving the efficiency of attractor cycle identification in Boolean networks , 2006 .

[4]  Harry B. Hunt,et al.  Predecessor existence problems for finite discrete dynamical systems , 2007, Theor. Comput. Sci..

[5]  Andrew Wuensche.  Basins of attraction in cellular automata , 2000, Complex..

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

[7]  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.

[8]  Andrew Wuensche.  Basins of attraction in cellular automata , 2000 .

[9]  Sumit Kumar Jha,et al.  Symbolic Approaches for Finding Control Strategies in Boolean Networks , 2007, APBC.

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

[11]  Giovanni De Micheli,et al.  An Efficient Method for Dynamic Analysis of Gene Regulatory Networks and in silico Gene Perturbation Experiments , 2007, RECOMB.

[12]  Aniruddha Datta,et al.  Generating Boolean networks with a prescribed attractor structure , 2005, Bioinform..

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

[14]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[15]  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.

[16]  S. Coppersmith.  Complexity of the predecessor problem in Kauffman networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[18]  M. Ng,et al.  Control of Boolean networks: hardness results and algorithms for tree structured networks. , 2007, Journal of theoretical biology.

[19]  Aniruddha Datta,et al.  Intervention in context-sensitive probabilistic Boolean networks , 2005, Bioinform..

[20]  Assaf Naor,et al.  Rigorous location of phase transitions in hard optimization problems , 2005, Nature.

[21]  Aniruddha Datta,et al.  External Control in Markovian Genetic Regulatory Networks , 2004, Machine Learning.

[22]  Tatsuya Akutsu,et al.  Algorithms for Inference, Analysis and Control of Boolean Networks , 2008, AB.

[23]  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 .

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

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

[26]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .