Detecting a singleton attractor in a Boolean network utilizing sat algorithms

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E92-A, Issue 2, 2009, Pages 493-501

  Tamura, Takeyuki ^a   Akutsu, Tatsuya ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Boolean network; Fixed point; NP hard; SAT; Singleton attractor

Indexed keywords

COMPUTER SCIENCE;

BOOLEAN NETWORK; BOOLEAN NETWORKS; FIXED POINTS; GENETIC NETWORKS; NP-HARD; SATISFIABILITY PROBLEMS; SINGLETON ATTRACTOR; TIME ALGORITHMS;

ELECTRICAL ENGINEERING;

EID: 71649101152     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1587/transfun.E92.A.493     Document Type: Article

References (23)

1. T. Akutsu, S. Kuhara, O. Maruyama, and S. Miyano, "A system for identifying genetic networks from gene expression patterns produced by gene disruptions and overexpressions," Genome Informatics, vol.9, pp.151-160, 1998.
2. T. Akutsu, S. Miyano, and S. Kuhara, "Inferring qualitative relations in genetic networks and metabolic pathways," Bioinformatics, vol.16, pp.727-734, 2000.
3. R. Albert and A-L. Barabasi, "Dynamics of complex systems: Scaling laws for the period of Boolean networks," Phys. Rev. Lett., vol.84, pp.5660-5663, 2000.
4. B. Drossel, T. Mihaljev, and F. Greil, "Number and length of attractors in a critical Kauffman model with connectivity one," Phys. Rev. Lett., vol.94, 088701, 2005.
5. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Co., New York, 1979.
6. L. Glass and S.A. Kauffman, "The logical analysis of continuous, nonlinear biochemical control networks," J. Theoret. Biol., vol.39, pp.103-129, 1973.
7. E.A. Hirsch, "New worst-case upper bounds for SAT," J. Automated Reasoning, vol.24, pp.397-420, 2000.
8. S. Huang, "Gene expression profiling, genetic networks, and cellular states: An integrating concept for tumorigenesis and drug discovery," J. Molecular Medicine, vol.77, no.6, pp.469-480, 1999.
9. D.J. Irons, "Improving the efficiency of attractor cycle identification in Boolean networks," Physica D, vol.217, no.1, pp.7-21, 2006.
10. K. Iwama and S. Tamaki, "Improved upper bounds for 3-SAT," Proc. 15th ACM-SIAM Symposium on Discrete Algorithms, p.328, 2004.
11. S. Kauffman, "Metabolic stability and epigenesis in randomly connected genetic nets," J. Theoret. Biol., vol.22, pp.437-467, 1968.
12. S. Kauffman, The Origin of Order: Self-organization and selection in evolution, Oxford Univ. Press, New York, 1993.
13. S. Kauffman, C, Peterson, B. Samuelsson, and C. Troein, "Random Boolean network models and the yeast transcriptional network," Proc. National Academy of Sciences, vol.100, no.25, pp.14796-14799, 2003.
14. M. Leone, A. Pagnani, G. Parisi, and O. Zagordi, "Finite size corrections to random Boolean networks," cond-mat, 0611088, 2006.
15. M. Milano and A. Roli, "Solving the satisfiability problem through Boolean networks," Lecture notes in Artificial Intelligence, vol.1792, pp.72-93, 2000.
16. A. Mochizuki, "An analytical study of the number of steady states in gene regulatory networks," J. Theoret. Biol., vol.236, pp.291-310, 2005.
17. D. Rolf, "Improved bound for the PPSZ/Schoning-algorithm for 3-SAT," J. Satisfiability, Boolean Modeling and Computation, vol.1, pp.111-122, 2006.
18. B. Samuelsson and C. Troein, "Superpolynomial growth in the number of attractors in Kauffman networks," Phys. Rev. Lett., vol.90, 098701, 2003.
19. I. Shmulevich and S. Kauffman, "Activities and sensitivities in Boolean network models," Phys. Rev. Lett., vol.93, no.4, 048701, 2004.
20. R. Somogyi and C.A. Sniegoski, "Modeling the complexity of genetic networks: Understanding multigenic and pleitropic regulation," Complexity, vol.1, no.6, pp.45-63, 1996.
21. 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.
22. m)-time deterministic algorithm for SAT," International Symposium on Algorithms and Computation, pp.644-653, 2005.
23. S. Zhang, M. Hayashida, T. Akutsu, W. Ching, and M.K. Ng, "Algorithms for finding small attractors in Boolean networks," EURASIP Journal on Bioinformatics and Systems Biology, 20180, 13 pages, 2007.