File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Finding optimal control policy in probabilistic Boolean networks with hard constraints by using integer programming and dynamic programming

TitleFinding optimal control policy in probabilistic Boolean networks with hard constraints by using integer programming and dynamic programming
Authors
Chen, XAkutsu, TTamura, TChing, WK
KeywordsBoolean Networks
Dynamic Programming
Integer Linear Programming
Optimal Control
Probabilistic Boolean Networks
Issue Date2010
Citation
The 2010 IEEE International Conference on Bioinformatics and Biomedicine (BiBM 2010), Hong Kong, China, 18-21 December 2010, p. 240-246, abstract no B323 How to Cite?
DOI: http://dx.doi.org/10.1109/BIBM.2010.5706570
AbstractIn this paper, we study control problems of Boolean Networks (BNs) and Probabilistic Boolean Networks (PBNs). 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 minimize the maximum cost of the terminal state to which the network will enter. Integer linear programming and dynamic programming in conjunction with hard constraints are then employed to solve the above problems. Numerical experiments are given to demonstrate the effectiveness of our algorithms.We also present a hardness result suggesting that PBN CONTROL is harder than BN CONTROL. ©2010 IEEE.
DescriptionSession 2 regular
Persistent Identifierhttp://hdl.handle.net/10722/158878
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorChen, Xen_US
dc.contributor.authorAkutsu, Ten_US
dc.contributor.authorTamura, Ten_US
dc.contributor.authorChing, WKen_US
dc.date.accessioned2012-08-08T09:04:03Z-
dc.date.available2012-08-08T09:04:03Z-
dc.date.issued2010en_US
dc.identifier.citationThe 2010 IEEE International Conference on Bioinformatics and Biomedicine (BiBM 2010), Hong Kong, China, 18-21 December 2010, p. 240-246, abstract no B323en_US
dc.identifier.urihttp://hdl.handle.net/10722/158878-
dc.descriptionSession 2 regular-
dc.description.abstractIn this paper, we study control problems of Boolean Networks (BNs) and Probabilistic Boolean Networks (PBNs). 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 minimize the maximum cost of the terminal state to which the network will enter. Integer linear programming and dynamic programming in conjunction with hard constraints are then employed to solve the above problems. Numerical experiments are given to demonstrate the effectiveness of our algorithms.We also present a hardness result suggesting that PBN CONTROL is harder than BN CONTROL. ©2010 IEEE.en_US
dc.languageengen_US
dc.relation.ispartofIEEE International Conference on Bioinformatics and Biomedicine Proceedingsen_US
dc.rights©2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.subjectBoolean Networksen_US
dc.subjectDynamic Programmingen_US
dc.subjectInteger Linear Programmingen_US
dc.subjectOptimal Controlen_US
dc.subjectProbabilistic Boolean Networksen_US
dc.titleFinding optimal control policy in probabilistic Boolean networks with hard constraints by using integer programming and dynamic programmingen_US
dc.typeConference_Paperen_US
dc.identifier.emailChing, WK:wching@hku.hken_US
dc.identifier.authorityChing, WK=rp00679en_US
dc.description.naturepublished_or_final_versionen_US
dc.identifier.doi10.1109/BIBM.2010.5706570en_US
dc.identifier.scopuseid_2-s2.0-79952404931en_US
dc.identifier.hkuros183861-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-79952404931&selection=ref&src=s&origin=recordpageen_US
dc.identifier.spage240en_US
dc.identifier.epage246en_US
dc.identifier.scopusauthoridChen, X=35772404700en_US
dc.identifier.scopusauthoridAkutsu, T=7102080520en_US
dc.identifier.scopusauthoridTamura, T=13609056800en_US
dc.identifier.scopusauthoridChing, WK=13310265500en_US

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats