|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/10790
|
| タイトル: | An integer programming approach to optimal control problems in context-sensitive probabilistic Boolean networks |
| 著者: | Kobayashi, Koichi
Hiraishi, Kunihiko |
| キーワード: | context-sensitive probabilistic Boolean networks
optimal control
integer programming
biological networks |
| 発行日: | 2011-02-21 |
| 出版者: | Elsevier |
| 誌名: | Automatica |
| 巻: | 47 |
| 号: | 6 |
| 開始ページ: | 1260 |
| 終了ページ: | 1264 |
| DOI: | 10.1016/j.automatica.2011.01.035 |
| 抄録: | A Boolean network is one of the models of biological networks such as gene regulatory networks, and has been extensively studied. In particular, a probabilistic Boolean network (PBN) is well known as an extension of Boolean networks, but in the existing methods to solve the optimal control problem of PBNs, it is necessary to compute the state transition diagram with 2^n nodes for a given PBN with n states. To avoid this computation, an integer programming-based approach is proposed for a context-sensitive PBN (CS-PBN), which is a general form of PBNs. In the proposed method, a CS-PBN is transformed into a linear system with binary variables, and the optimal control problem is reduced to an integer linear programming problem. By a numerical example, the effectiveness of the proposed method is shown. |
| Rights: | NOTICE: This is the author's version of a work accepted for publication by Elsevier. Koichi Kobayashi and Kunihiko Hiraishi, Automatica, 47(6), 2011, 1260-1264, http://dx.doi.org/10.1016/j.automatica.2011.01.035 |
| URI: | http://hdl.handle.net/10119/10790 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 17066.pdf | | 145Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
