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.