Experimental design schemes for learning Boolean network models

Accelerated knowledge discovery from omics data by optimal experimental design

How to design experiments that accelerate knowledge discovery on complex biological landscapes remains a tantalizing question. We present an optimal experimental design method (coined OPEX) to identify informative omics experiments using machine learning models for both experimental space exploration and model training. OPEX-guided exploration of Escherichia coli’s populations exposed to biocide and antibiotic combinations lead to more accurate predictive models of gene expression with 44% less data. Analysis of the proposed experiments shows that broad exploration of the experimental space followed by fine-tuning emerges as the optimal strategy. Additionally, analysis of the experimental data reveals 29 cases of cross-stress protection and 4 cases of cross-stress vulnerability. Further validation reveals the central role of chaperones, stress response proteins and transport pumps in cross-stress exposure. This work demonstrates how active learning can be used to guide omics data collection for training predictive models, making evidence-driven decisions and accelerating knowledge discovery in life sciences.

How to design experiments that accelerate knowledge discovery on complex biological landscapes remains a tantalizing question. Here, the authors present OPEX, an optimal experimental design method to identify informative omics experiments for both experimental space exploration and model training.

CrossPlan: systematic planning of genetic crosses to validate mathematical models

Motivation

Mathematical models of cellular processes can systematically predict the phenotypes of novel combinations of multi-gene mutations. Searching for informative predictions and prioritizing them for experimental validation is challenging since the number of possible combinations grows exponentially in the number of mutations. Moreover, keeping track of the crosses needed to make new mutants and planning sequences of experiments is unmanageable when the experimenter is deluged by hundreds of potentially informative predictions to test.

Results

We present CrossPlan, a novel methodology for systematically planning genetic crosses to make a set of target mutants from a set of source mutants. We base our approach on a generic experimental workflow used in performing genetic crosses in budding yeast. We prove that the CrossPlan problem is NP-complete. We develop an integer-linear-program (ILP) to maximize the number of target mutants that we can make under certain experimental constraints. We apply our method to a comprehensive mathematical model of the protein regulatory network controlling cell division in budding yeast. We also extend our solution to incorporate other experimental conditions such as a delay factor that decides the availability of a mutant and genetic markers to confirm gene deletions. The experimental flow that underlies our work is quite generic and our ILP-based algorithm is easy to modify. Hence, our framework should be relevant in plant and animal systems as well.

Availability and implementation

CrossPlan code is freely available under GNU General Public Licence v3.0 at https://github.com/Murali-group/crossplan.

Supplementary information

Supplementary data are available at Bioinformatics online.

Determining Relative Dynamic Stability of Cell States Using Boolean Network Model

Cell state transition is at the core of biological processes in metazoan, which includes cell differentiation, epithelial-to-mesenchymal transition (EMT) and cell reprogramming. In these cases, it is important to understand the molecular mechanism of cellular stability and how the transitions happen between different cell states, which is controlled by a gene regulatory network (GRN) hard-wired in the genome. Here we use Boolean modeling of GRN to study the cell state transition of EMT and systematically compare four available methods to calculate the cellular stability of three cell states in EMT in both normal and genetically mutated cases. The results produced from four methods generally agree but do not totally agree with each other. We show that distribution of one-degree neighborhood of cell states, which are the nearest states by Hamming distance, causes the difference among the methods. From that, we propose a new method based on one-degree neighborhood, which is the simplest one and agrees with other methods to estimate the cellular stability in all scenarios of our EMT model. This new method will help the researchers in the field of cell differentiation and cell reprogramming to calculate cellular stability using Boolean model, and then rationally design their experimental protocols to manipulate the cell state transition.

Dynamics in Epistasis Analysis

Finding regulatory relationships between genes, including the direction and nature of influence between them, is a fundamental challenge in the field of molecular genetics. One classical approach to this problem is epistasis analysis. Broadly speaking, epistasis analysis infers the regulatory relationships between a pair of genes in a genetic pathway by considering the patterns of change in an observable trait resulting from single and double deletion of genes. While classical epistasis analysis has yielded deep insights on numerous genetic pathways, it is not without limitations. Here, we explore the possibility of dynamic epistasis analysis, in which, in addition to performing genetic perturbations of a pathway, we drive the pathway by a time-varying upstream signal. We explore the theoretical power of dynamical epistasis analysis by conducting an identifiability analysis of Boolean models of genetic pathways, comparing static and dynamic approaches. We find that even relatively simple input dynamics greatly increases the power of epistasis analysis to discriminate alternative network structures. Further, we explore the question of experiment design, and show that a subset of short time-varying signals, which we call dynamic primitives, allow maximum discriminative power with a reduced number of experiments.

Discrete Dynamical Modeling of Influenza Virus Infection Suggests Age-Dependent Differences in Immunity

Immunosenescence, an age-related decline in immune function, is a major contributor to morbidity and mortality in the elderly. Older hosts exhibit a delayed onset of immunity and prolonged inflammation after an infection, leading to excess damage and a greater likelihood of death. Our study applies a rule-based model to infer which components of the immune response are most changed in an aged host. Two groups of BALB/c mice (aged 12 to 16 weeks and 72 to 76 weeks) were infected with 2 inocula: a survivable dose of 50 PFU and a lethal dose of 500 PFU. Data were measured at 10 points over 19 days in the sublethal case and at 6 points over 7 days in the lethal case, after which all mice had died. Data varied primarily in the onset of immunity, particularly the inflammatory response, which led to a 2-day delay in the clearance of the virus from older hosts in the sublethal cohort. We developed a Boolean model to describe the interactions between the virus and 21 immune components, including cells, chemokines, and cytokines, of innate and adaptive immunity. The model identifies distinct sets of rules for each age group by using Boolean operators to describe the complex series of interactions that activate and deactivate immune components. Our model accurately simulates the immune responses of mice of both ages and with both inocula included in the data (95% accurate for younger mice and 94% accurate for older mice) and shows distinct rule choices for the innate immunity arm of the model between younger and aging mice in response to influenza A virus infection.IMPORTANCE Influenza virus infection causes high morbidity and mortality rates every year, especially in the elderly. The elderly tend to have a delayed onset of many immune responses as well as prolonged inflammatory responses, leading to an overall weakened response to infection. Many of the details of immune mechanisms that change with age are currently not well understood. We present a rule-based model of the intrahost immune response to influenza virus infection. The model is fit to experimental data for young and old mice infected with influenza virus. We generated distinct sets of rules for each age group to capture the temporal differences seen in the immune responses of these mice. These rules describe a network of interactions leading to either clearance of the virus or death of the host, depending on the initial dosage of the virus. Our models clearly demonstrate differences in these two age groups, particularly in the innate immune responses.

A review of active learning approaches to experimental design for uncovering biological networks

Various types of biological knowledge describe networks of interactions among elementary entities. For example, transcriptional regulatory networks consist of interactions among proteins and genes. Current knowledge about the exact structure of such networks is highly incomplete, and laboratory experiments that manipulate the entities involved are conducted to test hypotheses about these networks. In recent years, various automated approaches to experiment selection have been proposed. Many of these approaches can be characterized as active machine learning algorithms. Active learning is an iterative process in which a model is learned from data, hypotheses are generated from the model to propose informative experiments, and the experiments yield new data that is used to update the model. This review describes the various models, experiment selection strategies, validation techniques, and successful applications described in the literature; highlights common themes and notable distinctions among methods; and identifies likely directions of future research and open problems in the area.

Active Interaction Mapping Reveals the Hierarchical Organization of Autophagy

We have developed a general progressive procedure, Active Interaction Mapping, to guide assembly of the hierarchy of functions encoding any biological system. Using this process, we assemble an ontology of functions comprising autophagy, a central recycling process implicated in numerous diseases. A first-generation model, built from existing gene networks in Saccharomyces, captures most known autophagy components in broad relation to vesicle transport, cell cycle, and stress response. Systematic analysis identifies synthetic-lethal interactions as most informative for further experiments; consequently, we saturate the model with 156,364 such measurements across autophagy-activating conditions. These targeted interactions provide more information about autophagy than all previous datasets, producing a second-generation ontology of 220 functions. Approximately half are previously unknown; we confirm roles for Gyp1 at the phagophore-assembly site, Atg24 in cargo engulfment, Atg26 in cytoplasm-to-vacuole targeting, and Ssd1, Did4, and others in selective and non-selective autophagy. The procedure and autophagy hierarchy are at http://atgo.ucsd.edu/.

Designing Experiments to Discriminate Families of Logic Models

Logic models of signaling pathways are a promising way of building effective in silico functional models of a cell, in particular of signaling pathways. The automated learning of Boolean logic models describing signaling pathways can be achieved by training to phosphoproteomics data, which is particularly useful if it is measured upon different combinations of perturbations in a high-throughput fashion. However, in practice, the number and type of allowed perturbations are not exhaustive. Moreover, experimental data are unavoidably subjected to noise. As a result, the learning process results in a family of feasible logical networks rather than in a single model. This family is composed of logic models implementing different internal wirings for the system and therefore the predictions of experiments from this family may present a significant level of variability, and hence uncertainty. In this paper, we introduce a method based on Answer Set Programming to propose an optimal experimental design that aims to narrow down the variability (in terms of input-output behaviors) within families of logical models learned from experimental data. We study how the fitness with respect to the data can be improved after an optimal selection of signaling perturbations and how we learn optimal logic models with minimal number of experiments. The methods are applied on signaling pathways in human liver cells and phosphoproteomics experimental data. Using 25% of the experiments, we obtained logical models with fitness scores (mean square error) 15% close to the ones obtained using all experiments, illustrating the impact that our approach can have on the design of experiments for efficient model calibration.