Automated large-scale control of gene regulatory networks.
Controlling gene regulatory networks (GRNs) is an important and hard problem. As it is the case in all control problems, the curse of dimensionality is the main issue in real applications. It is possible that hundreds of genes may regulate one biological activity in an organism; this implies a huge state space, even in the case of Boolean models. This is also evident in the literature that shows that only models of small portions of the genome could be used in control applications. In this paper, we empower our framework for controlling GRNs by eliminating the need for expert knowledge to specify some crucial threshold that is necessary for producing effective results. Our framework is characterized by applying the factored Markov decision problem (FMDP) method to the control problem of GRNs. The FMDP is a suitable framework for large state spaces as it represents the probability distribution of state transitions using compact models so that more space and time efficient algorithms could be devised for solving control problems. We successfully mapped the GRN control problem to an FMDP and propose a model reduction algorithm that helps find approximate solutions for large networks by using existing FMDP solvers. The test results reported in this paper demonstrate the efficiency and effectiveness of the proposed approach.
Department of Computer Engineering, Middle East Technical University, Ankara 06531, Turkey. mtan@ucalgary.ca
Mehmet
M
Tan
Reda
R
Alhajj
Faruk
F
Polat
D000465:Algorithms; D000818:Animals; D002453:Cell Cycle; D055808:Drug Discovery; D053263:Gene Regulatory Networks; D008322:Mammals; D008390:Markov Chains; D008957:Models, Genetic; D015233:Models, Statistical; D049490:Systems Biology / Q000379:methods*