The formulation of the control of an expression pattern in a gene network by propositional calculus.
In this study we model a gene network as a continuous-time switching network. In this model, each gene has a binary state which indicates if the gene expresses or not. We propose a method to control a sequence of expression patterns in the gene network model by adding another continuous-time switching network. By using propositional calculus, we will show that the control problem can be formulated as a mixed-integer linear programming problem with linear constraints.
Nakayama
Hideki
H
Graduate School of Engineering Science, Osaka University, 1-3 Machikaneyama, Toyonaka, Osaka 560-8531, Japan.
Tanaka
Hiroto
H
Ushio
Toshimitsu
T
D000818:Animals; D015870:Gene Expression; D020869:Gene Expression Profiling; D005786:Gene Expression Regulation; D053263:Gene Regulatory Networks; D008433:Mathematics; D008957:Models, Genetic