2013年
Finding optimal control policy in probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming
INTERNATIONAL JOURNAL OF DATA MINING AND BIOINFORMATICS
- ,
- ,
- ,
- 巻
- 7
- 号
- 3
- 開始ページ
- 322
- 終了ページ
- 343
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1504/IJDMB.2013.053306
- 出版者・発行元
- INDERSCIENCE ENTERPRISES LTD
Boolean Networks (BNs) and Probabilistic Boolean Networks (PBNs) are studied in this paper from the viewpoint of control problems. For BN CONTROL, by applying external control, we propose to derive the network to the desired state within a few time steps. For PBN CONTROL, we propose to find a control sequence such that the network will terminate in the desired state with a maximum probability. Also, we propose to minimise the maximum cost of the terminal state to which the network will enter. We also present a hardness result suggesting that PBN CONTROL is harder than BN CONTROL.
- リンク情報
-
- DOI
- https://doi.org/10.1504/IJDMB.2013.053306
- DBLP
- https://dblp.uni-trier.de/rec/journals/ijdmb/ChenATC13
- J-GLOBAL
- https://jglobal.jst.go.jp/detail?JGLOBAL_ID=201502825283202575
- PubMed
- https://www.ncbi.nlm.nih.gov/pubmed/23819262
- Web of Science
- https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000317720000006&DestApp=WOS_CPL
- URL
- http://dblp.uni-trier.de/db/journals/ijdmb/ijdmb7.html#journals/ijdmb/ChenATC13
- ID情報
-
- DOI : 10.1504/IJDMB.2013.053306
- ISSN : 1748-5673
- DBLP ID : journals/ijdmb/ChenATC13
- J-Global ID : 201502825283202575
- PubMed ID : 23819262
- Web of Science ID : WOS:000317720000006