ダウンロード数: 382
このアイテムのファイル:
| ファイル | 記述 | サイズ | フォーマット | |
|---|---|---|---|---|
| TCBB.2012.87.pdf | 257.89 kB | Adobe PDF | 見る/開く |
| タイトル: | Finding a Periodic Attractor of a Boolean Network. |
| 著者: | Akutsu, Tatsuya    https://orcid.org/0000-0001-9763-797X (unconfirmed)Kosub, Sven Melkman, Avraham A Tamura, Takeyuki https://orcid.org/0000-0003-1596-901X (unconfirmed) |
| 著者名の別形: | 阿久津, 達也 |
| キーワード: | Boolean network SAT nested canalyzing function periodic attractor treewidth |
| 発行日: | 12-Jun-2012 |
| 出版者: | IEEE and ACM |
| 誌名: | IEEE/ACM transactions on computational biology and bioinformatics |
| 巻: | 9 |
| 号: | 5 |
| 抄録: | In this paper, we study the problem of finding a periodic attractor of a Boolean network (BN), which arises in computational systems biology and is known to be NP-hard. Since a general case is quite hard to solve, we consider special but biologically important subclasses of BNs. For finding an attractor of period 2 of a BN consisting of n OR functions of positive literals, we present a polynomial time algorithm. For finding an attractor of period 2 of a BN consisting of n AND/OR functions of literals, we present an O(1.985n) time algorithm. For finding an attractor of a fixed period of a BN consisting of n nested canalyzing functions and having constant treewidth w, we present an O(n^[2p(w+1)]poly(n)) time algorithm. |
| 著作権等: | © 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. この論文は出版社版でありません。引用の際には出版社版をご確認ご利用ください。 This is not the published version. Please cite only the published version. |
| URI: | http://hdl.handle.net/2433/160365 |
| DOI(出版社版): | 10.1109/TCBB.2012.87 |
| PubMed ID: | 22689081 |
| 出現コレクション: | 学術雑誌掲載論文等 |
このリポジトリに保管されているアイテムはすべて著作権により保護されています。