Optimization-Based Approaches to Control of Probabilistic Boolean Networks

Boolean modelling as a logic-based dynamic approach in systems medicine

Molecular mechanisms of health and disease are often represented as systems biology diagrams, and the coverage of such representation constantly increases. These static diagrams can be transformed into dynamic models, allowing for in silico simulations and predictions. Boolean modelling is an approach based on an abstract representation of the system. It emphasises the qualitative modelling of biological systems in which each biomolecule can take two possible values: zero for absent or inactive, one for present or active. Because of this approximation, Boolean modelling is applicable to large diagrams, allowing to capture their dynamic properties. We review Boolean models of disease mechanisms and compare a range of methods and tools used for analysis processes. We explain the methodology of Boolean analysis focusing on its application in disease modelling. Finally, we discuss its practical application in analysing signal transduction and gene regulatory pathways in health and disease.

Policy Iteration Approach to the Infinite Horizon Average Optimal Control of Probabilistic Boolean Networks

This article studies the optimal control of probabilistic Boolean control networks (PBCNs) with the infinite horizon average cost criterion. By resorting to the semitensor product (STP) of matrices, a nested optimality equation for the optimal control problem of PBCNs is proposed. The Laurent series expression technique and the Jordan decomposition method derive a novel policy iteration-type algorithm, where finite iteration steps can provide the optimal state feedback law, which is presented. Finally, the intervention problem of the probabilistic Ara operon in E. coil, as a biological application, is solved to demonstrate the effectiveness and feasibility of the proposed theoretical approach and algorithms.

A framework to shift basins of attraction of gene regulatory networks through batch reinforcement learning

A major challenge in gene regulatory networks (GRN) of biological systems is to discover when and what interventions should be applied to shift them to healthy phenotypes. A set of gene activity profiles, called basin of attraction (BOA), takes this network to a specific phenotype; therefore, a healthy BOA leads the GRN to a healthy phenotype. However, without the complete observability of the genes, it is not possible to identify whether the current BOA is healthy. In this article we investigate external interventions in GRN with partial observability aiming to bring it to healthy BOAs. We propose a new batch reinforcement learning method (BRL), called mSFQI, to define intervention strategies based on the probabilities of the gene activity profiles being in healthy BOAs, which are calculated from a set of previous observed experiences. BRL uses approximation functions and repeated applications of previous experiences to accelerate learning. Results demonstrate that our proposal can quickly shift a partially observable GRN to healthy BOAs, while reducing the number of interventions. In addition, when observability is poor, mSFQI produces better results when the probabilities for a greater amount of previous observations are available.

On Optimal Time-Varying Feedback Controllability for Probabilistic Boolean Control Networks

This brief studies controllability for probabilistic Boolean control network (PBCN) with time-varying feedback control laws. The concept of feedback controllability with an arbitrary probability for PBCNs is formulated first, and a control problem to maximize the probability of time-varying feedback controllability is investigated afterward. By introducing semitensor product (STP) technique, an equivalent multistage decision problem is deduced, and then a novel optimization algorithm is proposed to obtain the maximum probability of controllability and the corresponding optimal feedback law simultaneously. The advantages of the time-varying optimal controller obtained by the proposed algorithm, compared to the time-invariant one, are illustrated by numerical simulations.

Boolean network analysis through the joint use of linear algebra and algebraic geometry

Among the various phenomena that can be modeled by Boolean networks, i.e., discrete-time dynamical systems with binary state variables, gene regulatory interactions are especially well known. Therefore, the analysis of Boolean networks is critical, e.g., to identify genetic pathways and to predict the effects of mutations on the cell functionality. Two methodologies (i.e., the semi-tensor product and the Gröbner bases over finite fields) have recently been proposed to tackle the problem of determining cycles and attractors (with the corresponding basin of attraction) for such systems. Here, it is shown that, by suitably coupling methodologies taken from these two fields (i.e., linear algebra and algebraic geometry), it is not only possible to determine cycles and attractors, but also to find closed-form solutions of the Boolean network. Such a goal is pursued by finding an immersion that recasts the Boolean dynamics in a linear form and by computing the closed-form solution of the latter system. The effectiveness of this technique is demonstrated by fully computing the solutions of the Boolean network modeling the differentiation of the Th-lymphocyte, a type of white blood cells involved in the human adaptive immune system.