Determining a singleton attractor of an AND/OR Boolean network in O(1.587n) time

Information Processing Letters

Volumn 110, Issue 14-15, 2010, Pages 565-569

  Melkman, Avraham A ^a   Tamura, Takeyuki ^b   Akutsu, Tatsuya ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

Algorithms; Boolean network; SAT; Singleton attractor

Indexed keywords

ALGORITHMS; COMPUTER APPLICATIONS; DATA PROCESSING;

BOOLEAN NETWORKS; RUNNING TIME; SINGLETON ATTRACTOR; TIME ALGORITHMS;

BOOLEAN ALGEBRA;

EID: 80053119334     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2010.05.001     Document Type: Article

References (10)

1. V. Devloo, P. Hansen, M. Labbé, Identification of all steady states in large networks by logical analysis, Bulletin of Mathematical Biology 65 (2003) 1025-1051. (Pubitemid 37446843)
2. A. Garg, A. DiCara, I. Xenarios, L. Mendoza, G. DeMicheli, Synchronous versus asynchronous modeling of gene regulatory networks, Bioinformatics 24 (2008) 1917-1925.
3. D.J. Irons, Improving the efficiency of attractor cycle identification in Boolean networks, Physica D 217 (2006) 7-21. (Pubitemid 44287871)
4. K. Iwama, Worst-case upper bounds for kSAT, Bulletin of the EATCS 82 (2004) 61-71.
5. S.A. Kauffman, The Origins of Order: Self-organization and Selection in Evolution, Oxford Univ. Press, New York, 1993.
6. M. Leone, A. Pagnani, G. Parisi, O. Zagordi, Finite size corrections to random Boolean networks, Journal of Statistical Mechanics: Theory and Experiment (2006) P12012.
7. 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-A2 (2009) 493-501.
8. T. Tamura, T. Akutsu, Algorithms for singleton attractor detection in planar and nonplanar AND/OR Boolean networks, Mathematics in Computer Science 2 (3) (2009) 401-420.
9. M. Yamamoto, An improved O (1.234m)-time deterministic algorithm for SAT, in: Proc. International Symposium on Algorithms and Computation, 2005, pp. 644-653. (Pubitemid 43856291)
10. M. Yamamoto, Finding a stable state in an AND/OR Boolean network based on a maximum matching, personal communication.