File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: 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
KeywordsBoolean networks
PBN
probabilistic Boolean networks
optimal control
integer linear programming
Issue Date2013
PublisherInderscience Publishers. The Journal's web site is located at http://www.inderscience.com/ijdmb
Citation
International Journal of Data Mining and Bioinformatics, 2013, v. 7 n. 3, p. 322-343 How to Cite?
AbstractBoolean 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.
Persistent Identifierhttp://hdl.handle.net/10722/181980
ISSN
2015 Impact Factor: 0.528
2015 SCImago Journal Rankings: 0.289
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorChen, Xen_US
dc.contributor.authorAkutsu, Ten_US
dc.contributor.authorTamura, Ten_US
dc.contributor.authorChing, WKen_US
dc.date.accessioned2013-04-17T07:16:13Z-
dc.date.available2013-04-17T07:16:13Z-
dc.date.issued2013en_US
dc.identifier.citationInternational Journal of Data Mining and Bioinformatics, 2013, v. 7 n. 3, p. 322-343en_US
dc.identifier.issn1748-5673-
dc.identifier.urihttp://hdl.handle.net/10722/181980-
dc.description.abstractBoolean 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.-
dc.languageengen_US
dc.publisherInderscience Publishers. The Journal's web site is located at http://www.inderscience.com/ijdmb-
dc.relation.ispartofInternational Journal of Data Mining and Bioinformaticsen_US
dc.rightsInternational Journal of Data Mining and Bioinformatics. Copyright © Inderscience Publishers.-
dc.subjectBoolean networks-
dc.subjectPBN-
dc.subjectprobabilistic Boolean networks-
dc.subjectoptimal control-
dc.subjectinteger linear programming-
dc.titleFinding optimal control policy in probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programmingen_US
dc.typeArticleen_US
dc.identifier.emailChing, WK: wching@hku.hken_US
dc.identifier.authorityChing, WK=rp00679en_US
dc.identifier.doi10.1504/IJDMB.2013.053306-
dc.identifier.pmid23819262-
dc.identifier.scopuseid_2-s2.0-84876589341-
dc.identifier.hkuros214043en_US
dc.identifier.volume7en_US
dc.identifier.issue3-
dc.identifier.spage322en_US
dc.identifier.epage343en_US
dc.identifier.isiWOS:000317720000006-
dc.publisher.placeUnited Kingdom-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats