On the Complexity of Inference and Completion of Boolean Networks from Given Singleton Attractors-Reference-Cited by-同舟云学术

On the Complexity of Inference and Completion of Boolean Networks from Given Singleton Attractors

Published:2013 Issue:11 Volume:E96.A Page:2265-2274
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

JIANG Hao¹²,TAMURA Takeyuki³,CHING Wai-Ki²,AKUTSU Tatsuya³

Affiliation:

1. Department of Mathematics, Renmin University of China

2. Department of Mathematics, The University of Hong Kong

3. Bioinformatics Center, Institute for Chemical Research, Kyoto University

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

https://www.jstage.jst.go.jp/article/transfun/E96.A/11/E96.A_2265/_pdf

Reference36 articles.

1. [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. [2] T. Akutsu, S. Miyano, and S. Kuhara, “Identification of genetic networks from a small number of gene expression patterns under the Boolean network model,” Proc. Pacific Symposium on Biocomputing, vol.4, pp.17-28, 1999.

3. [3] T. Akutsu, T. Tamura, and K. Horimoto, “Completing networks using observed data,” Lect. Notes Comput. Sci., no.5809, pp.14-23, 2009.

4. [4] T. Akutsu, A.A. Melkman, T. Tamura, and M. Yamamoto, “Determining a singleton attractor of a Boolean network with nested canalyzing functions,” J. Computational Biology, vol.18, pp.1275-1290, 2011.

5. [5] T. Akutsu, S. Kosub, A.A. Melkman, and T. Tamura. “Finding a periodic attractor of a Boolean network,” IEEE/ACM Trans. Computational Biology and Bioinformatics, vol.9, pp.1410-1421, 2012.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Design of Probabilistic Boolean Networks Based on Network Structure and Steady-State Probabilities;IEEE Transactions on Neural Networks and Learning Systems;2017-08