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

Proceedings - 2010 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2010

Volumn , Issue , 2010, Pages 240-246

  Chen, Xi ^a   Akutsu, Tatsuya ^b   Tamura, Takeyuki ^b   Ching, Wai Ki ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

Boolean networks; Dynamic programming; Integer linear programming; Optimal control; Probabilistic Boolean networks

Indexed keywords

BOOLEAN NETWORKS; CONTROL PROBLEMS; CONTROL SEQUENCES; EXTERNAL CONTROL; HARD CONSTRAINTS; HARDNESS RESULT; INTEGER LINEAR PROGRAMMING; MAXIMUM PROBABILITY; NUMERICAL EXPERIMENTS; OPTIMAL CONTROL POLICY; OPTIMAL CONTROLS; PROBABILISTIC BOOLEAN NETWORKS; TERMINAL STATE; TIME STEP;

BIOINFORMATICS; CONTROL; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTIMIZATION;

DYNAMIC PROGRAMMING;

EID: 79952404931     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BIBM.2010.5706570     Document Type: Conference Paper

References (14)

1. W. Ching, E. Fung, M. Ng, and T. Akutsu, "On construction of stochastic genetic networks based on gene expression sequences," Journal of Neural Systems, vol. 15, pp. 297-310, 2005.
2. H. de Jong, "Modeling and simulation of genetic regulatory systems: A literature review," Journal of Computational Biology, vol. 9, pp. 69-103, 2002.
3. S. A. Kauffman, The Origins of Order: Self-organization and Selection in Evolution. NY: Oxford Univ. Press, 1993.
4. T. Akutsu, M. Hayashida, W.-K. Ching, and M. Ng, "Control of Boolean networks: Hardness results and algorithms for tree structured networks," Journal of Theoretical Biology, vol. 244, pp. 670-679, 2007.
5. T. Akutsu, M. Hayashida, and T. Tamura, "Integer programming-based methods for attractor detection and control of Boolean networks," in Proc. the Combined 48th IEEE Conference on Decision and Control and 28th Chinese Control Conference, 2009, pp. 5610-5617.
6. W. Ching, S. Zhang, Y. Jiao, T. Akutsu, and N. Tsing, "Optimal control policy for probabilistic Boolean networks with hard constraints," IET Systems Biology, vol. 3, pp. 90-99, 2009.
7. K. Kobayashi and K. Hiraishi, "An integer programming approach to control problems in probabilistic boolean networks," in Proc. 2010 American Control Conference, 2010, pp. 6710-6715.
8. A. Datta, A. Choudhary, M. L. Bittner, and E. R. Dougherty, "External control in Markovian genetic regulatory networks," Machine Learning, vol. 52, pp. 169-191, 2003.
9. C. L. Barrett, H. B. Hunt III, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and R. E. Stearns, "Complexity of reachability problems for finite discrete dynamical systems," Journal of Computer and System Sciences, vol. 72, pp. 1317-1345, 2006.
10. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. NY:W.H. Freeman and Company, 1979.
11. E. R. Dougherty, S. Kim, and Y. Chen, "Coefficient of determination in nonlinear signal processing," Machine Learning, vol. 80, pp. 2219-2235, 2000.
12. C. L. Barrett, H. B. Hunt III, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, R. E. Stearns, and M. Thakur, "Computational aspects of analyzing social network dynamics," in Proc. 20th International Joint Conference on Artificial Intelligence, 2007, pp. 2268-2273.
13. L. J. Stockmeyer, "The polynomial-time hierarchy," Theoretical Computer Science, vol. 3, pp. 1-22, 1976.
14. S. Kim, H. Li, E. R. Dougherty, N. Cao, Y. Chen, M. Bittner, and E. Suh, "Can Markov chain models mimic biological regulations?" Journal of Biological Systems, vol. 10, pp. 337-357, 2002.