Abstract

BackgroundA fundamental problem for translational genomics is to find optimal therapies based on gene regulatory intervention. Dynamic intervention involves a control policy that optimally reduces a cost function based on phenotype by externally altering the state of the network over time. When a gene regulatory network (GRN) model is fully known, the problem is addressed using classical dynamic programming based on the Markov chain associated with the network. When the network is uncertain, a Bayesian framework can be applied, where policy optimality is with respect to both the dynamical objective and the uncertainty, as characterized by a prior distribution. In the presence of uncertainty, it is of great practical interest to develop an experimental design strategy and thereby select experiments that optimally reduce a measure of uncertainty.ResultsIn this paper, we employ mean objective cost of uncertainty (MOCU), which quantifies uncertainty based on the degree to which uncertainty degrades the operational objective, that being the cost owing to undesirable phenotypes. We assume that a number of conditional probabilities characterizing regulatory relationships among genes are unknown in the Markovian GRN. In sum, there is a prior distribution which can be updated to a posterior distribution by observing a regulatory trajectory, and an optimal control policy, known as an “intrinsically Bayesian robust” (IBR) policy. To obtain a better IBR policy, we select an experiment that minimizes the MOCU remaining after applying its output to the network. At this point, we can either stop and find the resulting IBR policy or proceed to determine more unknown conditional probabilities via regulatory observation and find the IBR policy from the resulting posterior distribution. For sequential experimental design this entire process is iterated. Owing to the computational complexity of experimental design, which requires computation of many potential IBR policies, we implement an approximate method utilizing mean first passage times (MFPTs) – but only in experimental design, the final policy being an IBR policy.ConclusionsComprehensive performance analysis based on extensive simulations on synthetic and real GRNs demonstrate the efficacy of the proposed method, including the accuracy and computational advantage of the approximate MFPT-based design.

Highlights

  • A fundamental problem for translational genomics is to find optimal therapies based on gene regulatory intervention

  • We extend the application of the objectivebased experimental design for gene regulatory network (GRN) to the realm of dynamical interventions

  • Taking into account complexity considerations with optimal Bayesian robust (OBR), we focus on intrinsically Bayesian robust” (IBR) stationary policies for our experimental design problem, which still requires massive computations but at a more tolerable cost compared to OBR policies

Read more

Summary

Introduction

A fundamental problem for translational genomics is to find optimal therapies based on gene regulatory intervention. Most intervention strategies in the literature assume perfect knowledge regarding the network model This is not a realistic assumption in many real-world biomedical applications as uncertainty is inherent in genomics due to the complexity of biological systems, experimental limitations, noise, etc. An example of which are probabilistic Boolean networks (PBNs), have received great attention in recent years [1,2,3,4,5]. These networks have been shown to be effective in mimicking the behavior of biological systems, as they are able to capture the randomness of biological phenomena by means of a transition probability matrix (TPM). The basic assumption behind many intervention algorithms is that the TPM is perfectly known

Objectives
Methods
Results
Discussion
Conclusion
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