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

Authors:
Avraham A. Melkman;Takeyuki Tamura;Tatsuya Akutsu
Affiliations:
Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84105;Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto, Japan 611-0011;Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto, Japan 611-0011
Venue:
Information Processing Letters
Year:
2010

Citing 2
Cited 3

Synchronous versus asynchronous modeling of gene regulatory networks

Bioinformatics
An improved Õ(1.234m)-time deterministic algorithm for SAT

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Singleton and 2-periodic attractors of sign-definite Boolean networks

Information Processing Letters
Logic programming for Boolean networks

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Finding a Periodic Attractor of a Boolean Network

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Quantified Score

Hi-index	0.89

Visualization

Abstract