Finding optimal control policy in probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming

Authors:
Xi Chen;Tatsuya Akutsu;Takeyuki Tamura;Wai-Ki Ching
Affiliations:
Advanced Modelling and Applied Computing Laboratory, Department of Mathematics, The University of Hong Kong, Pokfulam Road, Hong Kong;Bioinformatics Center, Institute for Chemical Research, Kyoto University, Japan Gokasho, Uji, Kyoto 611-0011, Japan;Bioinformatics Center, Institute for Chemical Research, Kyoto University, Japan Gokasho, Uji, Kyoto 611-0011, Japan;Advanced Modelling and Applied Computing Laboratory, Department of Mathematics, The University of Hong Kong, Pokfulam Road, Hong Kong
Venue:
International Journal of Data Mining and Bioinformatics
Year:
2013

Citing 8
Cited 0

Coefficient of determination in nonlinear signal processing

Signal Processing - Special section on signal processing technologies for short burst wireless communications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
External Control in Markovian Genetic Regulatory Networks

Machine Learning
Complexity of reachability problems for finite discrete dynamical systems

Journal of Computer and System Sciences
Simulation study in Probabilistic Boolean Network models for genetic regulatory networks

International Journal of Data Mining and Bioinformatics
Computational aspects of analyzing social network dynamics

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Input-state approach to boolean networks

IEEE Transactions on Neural Networks
Modelling gene and protein regulatory networks with Answer Set Programming

International Journal of Data Mining and Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.