|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/9893
|
| タイトル: | Polynomial-Time Algorithm for Controllability Test of a Class of Boolean Biological Networks |
| 著者: | Kobayashi, Koichi
Imura, Jun-ichi
Hiraishi, Kunihiko |
| 発行日: | 2010-07-08 |
| 出版者: | Hindawi Publishing Corporation |
| 誌名: | EURASIP Journal on Bioinformatics and Systems Biology |
| 巻: | 2010 |
| 開始ページ: | Article ID 210685 |
| DOI: | 10.1155/2010/210685 |
| 抄録: | In recent years, Boolean-network-model-based approaches to dynamical analysis of complex biological networks such as gene regulatory networks have been extensively studied. One of the fundamental problems in control theory of such networks is the problem of determining whether a given substance quantity can be arbitrarily controlled by operating the other substance quantities, which we call the controllability problem. This paper proposes a polynomial-time algorithm for solving this problem. Although the algorithm is based on a sufficient condition for controllability, it is easily computable for a wider class of large-scale biological networks compared with the existing approaches. A key to this success in our approach is to give up computing Boolean operations in a rigorous way and to exploit an adjacency matrix of a directed graph induced by a Boolean network. By applying the proposed approach to a neurotransmitter signaling pathway, it is shown that it is effective. |
| Rights: | Copyright © 2010 Koichi Kobayashi 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. |
| URI: | http://hdl.handle.net/10119/9893 |
| 資料タイプ: | publisher |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 15688.pdf | | 263Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
