| Project/Area Number |
23700017
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Kyoto University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2011 – 2012
|
| Project Status |
Completed (Fiscal Year 2013)
|
| Budget Amount *help |
¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
Fiscal Year 2012: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2011: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
|
|---|
| Keywords | 遺伝子制御ネットワーク / ブーリアンモデル / 定常状態 / アルゴリズム / 数理モデル / 代謝ネットワーク / 計算量理論 / 充足可能性問題 / バイオインフォマティクス / 整数計画法 / 動的計画法 |
|---|
| Research Abstract |
The Boolean network (BN) is a discrete mathematical model for describing regulatory relationship of genes in cells. Although problems for finding stable states of BNs and control strategies are known to be NP-hard, they are often solvable for middle size networks due to recent high performance computing vie exact algorithms and/or integer programming-based methods.
In this research, exact algorithms for finding attractors of period 2 were developed. Furthermore, integer programming-based methods were developed for problems for finding singleton attractors, control of BNs, and control of attractors.
|
