Abstract

As a paradigm for modeling gene regulatory networks, probabilistic Boolean networks (PBNs) form a subclass of Markov genetic regulatory networks. To date, many different stochastic optimal control approaches have been developed to find therapeutic intervention strategies for PBNs. A PBN is essentially a collection of constituent Boolean networks via a probability structure. Most of the existing works assume that the probability structure for Boolean networks selection is known. Such an assumption cannot be satisfied in practice since the presence of noise prevents the probability structure from being accurately determined. In this paper, we treat a case in which we lack the governing probability structure for Boolean network selection. Specifically, in the framework of PBNs, the theory of finite horizon Markov decision process is employed to find optimal constituent Boolean networks with respect to the defined objective functions. In order to illustrate the validity of our proposed approach, an example is also displayed.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call