EURASIP Journal on Bioinformatics and Systems Biology
Volume 2008 (2008), Article ID 521407, 16 pages
doi:10.1155/2008/521407
Research Article

Algorithms and Complexity Analyses for Control of Singleton Attractors in Boolean Networks

Morihiro Hayashida,1 Takeyuki Tamura,1 Tatsuya Akutsu,1 Shu-Qin Zhang,2 and Wai-Ki Ching3

1Bioinformatics Center, Laboratory of Biological Information Networks, Bioinformatics Center, Institute for Chemical Research, Kyoto University, Uji, Kyoto 611-0011, Japan
2School of Mathematical Sciences, Fudan University, Shanghai 200433, China
3Advanced Modeling and Applied Computing Laboratory, Department of Mathematics, The University of Hong Kong, Pokfulam Road, Hong Kong

Received 12 January 2008; Revised 4 April 2008; Accepted 2 June 2008

Academic Editor: Ilya Shmulevich

Copyright © 2008 Morihiro Hayashida et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

How to Cite this Article

Morihiro Hayashida, Takeyuki Tamura, Tatsuya Akutsu, Shu-Qin Zhang, and Wai-Ki Ching, “Algorithms and Complexity Analyses for Control of Singleton Attractors in Boolean Networks,” EURASIP Journal on Bioinformatics and Systems Biology, vol. 2008, Article ID 521407, 16 pages, 2008. doi:10.1155/2008/521407