| Item type |
SIG Technical Reports(1) |
| 公開日 |
2017-09-19 |
| タイトル |
|
|
タイトル |
On the Minimum Number of Genes Required for Discriminating Steady States under a Boolean Model |
| タイトル |
|
|
言語 |
en |
|
タイトル |
On the Minimum Number of Genes Required for Discriminating Steady States under a Boolean Model |
| 言語 |
|
|
言語 |
eng |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_18gh |
|
資源タイプ |
technical report |
| 著者所属 |
|
|
|
School of Mathematics and Statistics, Xi'an Jiaotong University |
| 著者所属 |
|
|
|
Bioinformatics Center, Institute for Chemical Research, Kyoto University |
| 著者所属 |
|
|
|
Department of Mathematics, The University of Hong Kong |
| 著者所属 |
|
|
|
Bioinformatics Center, Institute for Chemical Research, Kyoto University |
| 著者所属(英) |
|
|
|
en |
|
|
School of Mathematics and Statistics, Xi'an Jiaotong University |
| 著者所属(英) |
|
|
|
en |
|
|
Bioinformatics Center, Institute for Chemical Research, Kyoto University |
| 著者所属(英) |
|
|
|
en |
|
|
Department of Mathematics, The University of Hong Kong |
| 著者所属(英) |
|
|
|
en |
|
|
Bioinformatics Center, Institute for Chemical Research, Kyoto University |
| 著者名 |
Xiaoqing, Cheng
Takeyuki, Tamura
Wai-ki, Ching
Tatsuya, Akutsu
|
| 著者名(英) |
Xiaoqing, Cheng
Takeyuki, Tamura
Wai-ki, Ching
Tatsuya, Akutsu
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Identifying the type of each cell by observing gene expression patterns of a few genes is an important research topic. Since attractors are often regarded to correspond to cell types, we study the problem of finding a minimum set of nodes for discriminating given attractors, under the Boolean network model. We present combinatorial algorithms and analyze their time complexities. In particular, we prove that one node is not necessarily enough but two nodes are always enough to discriminate two periodic attractors. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Identifying the type of each cell by observing gene expression patterns of a few genes is an important research topic. Since attractors are often regarded to correspond to cell types, we study the problem of finding a minimum set of nodes for discriminating given attractors, under the Boolean network model. We present combinatorial algorithms and analyze their time complexities. In particular, we prove that one node is not necessarily enough but two nodes are always enough to discriminate two periodic attractors. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AA12055912 |
| 書誌情報 |
研究報告バイオ情報学（BIO）
巻 2017-BIO-51,
号 12,
p. 1-2,
発行日 2017-09-19
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
2188-8590 |
| Notice |
|
|
|
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-BIO17051012.pdf (577.6 kB)
