Algorithms for singleton attractor detection in planar and nonplanar AND/OR Boolean networks

Mathematics in Computer Science

Volumn 2, Issue 3, 2009, Pages 401-420

  Tamura, Takeyuki ^a   Akutsu, Tatsuya ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Algorithm and planar graph; Boolean network; Fixed point

Indexed keywords

EID: 76349116289     PISSN: 16618270     EISSN: 16618289     Source Type: Journal    
DOI: 10.1007/s11786-008-0063-5     Document Type: Article

References (31)

1. T. Akutsu, S. Kuhara, O. Maruyama, S. Miyano, A system for identifying genetic networks from gene expression patterns produced by gene disruptions and overex-pressions, Genome Informatics, 9:151-160, 1998.
2. T. Akutsu, S. Miyano, S. Kuhara, Inferring qualitative relations in genetic networks and metabolic pathways, Bioinformatics, 16:727-734, 2000.
3. R. Albert, A-L. Barabasi, Dynamics of complex systems: Scaling laws for the period of Boolean networks, Physical Review Letters, 84:5660-5663, 2000.
4. J. Aracena, J. Demongeot, E. Goles, Fixed points and maximal independent sets in AND-OR networks, Discrete Applied Mathematics, 138:277-288, 2004.
5. F. Dorn, E. Penninkx, H. L. Bodlaender, F. V. Fomin, Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions, Proc. 13th Annual European Symposium on Algorithms, 95-106, 2005.
6. B. Drossel, T. Mihaljev and F. Greil, Number and length of attractors in a critical Kauffman model with connectivity one, Physical Review Letters, 94:088701, 2005.
7. L. Glass, S. A. Kauffman, The logical analysis of continuous, nonlinear biochemical control networks, Journal of Theoretical Biology, 39:103-129, 1973.
8. E. Goles, G. Hernandez, Dynamical behavior of Kauffman networks with AND-OR gates, Journal of Biological Systems, 8(2):151-175, 2000.
9. E. A. Hirsch, New worst-case upper bounds for SAT, Journal of Automated Reasoning, 24:397-420, 2000.
10. S. Huang, Gene expression profiling, genetic networks, and cellular states: an integrating concept for tumorigenesis and drug discovery, Journal of Molecular Medicine, 77(6):469-480, 1999.
11. K. Iwama, S. Tamaki, Improved upper bounds for 3-SAT, Proc. 15th ACM-SIAM Symposium on Discrete Algorithms, pp. 328, 2004.
12. A. S. Jarrah, B. Raposa, R. Laubenbacher, Nested canalyzing, unate cascade, and polynomial functions Physica D, 233(2):167-174, 2007.
13. S. Kauffman, Metabolic stability and epigenesis in randomly connected genetic nets, Journal of Theoretical Biology, 22:437-467, 1968.
14. S. Kauffman, The Origin of Order: Self-organization and selection in evolution, Oxford Univ. Press, New York, 1993.
15. S. Kauffman, C, Peterson, B. Samuelsson, C. Troein, Random Boolean network models and the yeast transcriptional network, Proceedings of the National Academy of Sciences, 100(25):14796-14799, 2003.
16. S. Kosub, Dichotomy results for fixed-points existence problems for Boolean dynamical systems, Mathematics in Computer Science, 1:487-505, 2008.
17. M. Leone, A. Pagnani, G. Parisi, O. Zagordi, Finite size corrections to random Boolean networks, cond-mat/0611088, 2006.
18. D. Lichtenstein, Planar formulae and their uses, SIAM Journal on Computing, 11(2):329-343, 1982.
19. R. J. Lipton, R. E. Tarjan, A separator theorem for planar graphs, SIAM Journal on Applied Mathematics, 36:177-189, 1979.
20. M. Milano, A. Roli, Solving the satisfiability problem through Boolean networks, Lecture notes in Artificial Intelligence, 1792:72-93, 2000.
21. A. Mochizuki, An analytical study of the number of steady states in gene regulatory networks, J. Theoret. Biol., 236:291-310, 2005.
22. D. Rolf, Improved bound for the PPSZ/Schöning-Algorithm for 3-SAT. Journal of Satisfiability, Boolean Modeling and Computation, 1:111-122, 2006.
23. B. Samuelsson and C. Troein, Superpolynomial growth in the number of attractors in Kauffman networks, Physical Review Letters, 90:098701, 2003.
24. I. Shmulevich, S. Kauffman, Activities and sensitivities in Boolean network models, Physical Review Letters, 93(4):048701, 2004.
25. R. Somogyi, C. A. Sniegoski, Modeling the complexity of genetic networks: Understanding multigenic and pleitropic regulation, Complexity, 1(6):45-63, 1996.
26. T. Tamura, T. Akutsu, Detecting a Singleton Attractor in a Boolean Network Utilizing SAT Algorithms, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E92-A(2) (in press).
27. n)-time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes, Proc. International Symposium on Fundamentals of Computation Theory, pp. 494-505, 2007.
28. T. Tamura, T. Akutsu, An improved algorithm for detecting a singleton attractor in a Boolean network consisting of AND/OR nodes, Proc. International Conference on Algebraic Biology, pp. 216-229, 2008.
29. P. Tošić, On the complexity of counting fixed points and gardens of Eden in sequential dynamical systems on planar bipartite graphs, International Journal of Foundations of Computer Science, 17:1179-1203, 2006.
30. m)-time deterministic algorithm for SAT, Proc. International Symposium on Algorithms and Computation, pp. 644-653, 2005.
31. S. Zhang, M. Hayashida, T. Akutsu, W. Ching, M. K. Ng, Algorithms for finding small attractors in Boolean networks, EURASIP Journal on Bioinformatics and Systems Biology, 2007:20180, 2007.