A declarative constraint-based method for analyzing discrete genetic regulatory networks

Gene Regulatory Network Dynamical Logical Models for Plant Development

Mathematical and computational approaches that integrate and model the concerted action of multiple genetic and nongenetic components holding highly nonlinear interactions are fundamental for the study of developmental processes. Among these, gene regulatory network (GRN) dynamical models are very useful to understand how diverse types of regulatory constraints restrict the multigene expression patterns that characterize different cell fates. In this chapter we present a hands-on approach to model GRN dynamics, taking as a working example a well-curated and experimentally grounded GRN developmental module proposed by our group: the flower organ specification gene regulatory network (FOS-GRN). We demonstrate how to build and analyze a GRN model according to the following steps: (1) integration of molecular genetic data and formulation of logical rules specifying the dynamic behavior of each gene; (2) determination of steady states (attractors) corresponding to each cell type; (3) validation of the GRN model; and (4) extension of the deterministic model with the inclusion of stochasticity in order to model cell-state transitions dependent on noise due to fluctuations of the involved gen products. The methodologies explained here in detail can be applied to any other developmental module.

On Computing Structural and Behavioral Complexities of Threshold Boolean Networks : Application to Biological Networks

Various threshold Boolean networks (TBNs), a formalism used to model different types of biological networks (genes notably), can produce similar dynamics, i.e. share same behaviors. Among them, some are complex (according to Kolmogorov complexity), others not. By computing both structural and behavioral complexities, we show that most TBNs are structurally complex, even those having simple behaviors. For this purpose, we developed a new method to compute the structural complexity of a TBN based on estimates of the sizes of equivalence classes of the threshold Boolean functions composing the TBN.

Molecular mechanisms underlying COPD-muscle dysfunction unveiled through a systems medicine approach

MOTIVATION

Skeletal muscle dysfunction is a systemic effect in one-third of patients with chronic obstructive pulmonary disease (COPD), characterized by high reactive-oxygen-species (ROS) production and abnormal endurance training-induced adaptive changes. However, the role of ROS in COPD remains unclear, not least because of the lack of appropriate tools to study multifactorial diseases.

RESULTS

We describe a discrete model-driven method combining mechanistic and probabilistic approaches to decipher the role of ROS on the activity state of skeletal muscle regulatory network, assessed before and after an 8-week endurance training program in COPD patients and healthy subjects. In COPD, our computational analysis indicates abnormal training-induced regulatory responses leading to defective tissue remodeling and abnormal energy metabolism. Moreover, we identified tnf, insr, inha and myc as key regulators of abnormal training-induced adaptations in COPD. The tnf-insr pair was identified as a promising target for therapeutic interventions. Our work sheds new light on skeletal muscle dysfunction in COPD, opening new avenues for cost-effective therapies. It overcomes limitations of previous computational approaches showing high potential for the study of other multi-factorial diseases such as diabetes or cancer.

CONTACT

jroca@clinic.ub.es or martacascante@ub.eduSupplementary information: Supplementary data are available at Bioinformatics online.

Networks and games for precision medicine

Recent advances in omics technologies provide the leverage for the emergence of precision medicine that aims at personalizing therapy to patient. In this undertaking, computational methods play a central role for assisting physicians in their clinical decision-making by combining data analysis and systems biology modelling. Complex diseases such as cancer or diabetes arise from the intricate interplay of various biological molecules. Therefore, assessing drug efficiency requires to study the effects of elementary perturbations caused by diseases on relevant biological networks. In this paper, we propose a computational framework called Network-Action Game applied to best drug selection problem combining Game Theory and discrete models of dynamics (Boolean networks). Decision-making is modelled using Game Theory that defines the process of drug selection among alternative possibilities, while Boolean networks are used to model the effects of the interplay between disease and drugs actions on the patient's molecular system. The actions/strategies of disease and drugs are focused on arc alterations of the interactome. The efficiency of this framework has been evaluated for drug prediction on a model of breast cancer signalling.

A Method to Identify and Analyze Biological Programs through Automated Reasoning

Predictive biology is elusive because rigorous, data-constrained, mechanistic models of complex biological systems are difficult to derive and validate. Current approaches tend to construct and examine static interaction network models, which are descriptively rich, but often lack explanatory and predictive power, or dynamic models that can be simulated to reproduce known behavior. However, in such approaches implicit assumptions are introduced as typically only one mechanism is considered, and exhaustively investigating all scenarios is impractical using simulation. To address these limitations, we present a methodology based on automated formal reasoning, which permits the synthesis and analysis of the complete set of logical models consistent with experimental observations. We test hypotheses against all candidate models, and remove the need for simulation by characterizing and simultaneously analyzing all mechanistic explanations of observed behavior. Our methodology transforms knowledge of complex biological processes from sets of possible interactions and experimental observations to precise, predictive biological programs governing cell function.

An overview of existing modeling tools making use of model checking in the analysis of biochemical networks

Model checking is a well-established technique for automatically verifying complex systems. Recently, model checkers have appeared in computer tools for the analysis of biochemical (and gene regulatory) networks. We survey several such tools to assess the potential of model checking in computational biology. Next, our overview focuses on direct applications of existing model checkers, as well as on algorithms for biochemical network analysis influenced by model checking, such as those using binary decision diagrams (BDDs) or Boolean-satisfiability solvers. We conclude with advantages and drawbacks of model checking for the analysis of biochemical networks.

"Antelope": a hybrid-logic model checker for branching-time Boolean GRN analysis

Background

In Thomas' formalism for modeling gene regulatory networks (GRNs), branching time, where a state can have more than one possible future, plays a prominent role. By representing a certain degree of unpredictability, branching time can model several important phenomena, such as (a) asynchrony, (b) incompletely specified behavior, and (c) interaction with the environment. Introducing more than one possible future for a state, however, creates a difficulty for ordinary simulators, because infinitely many paths may appear, limiting ordinary simulators to statistical conclusions. Model checkers for branching time, by contrast, are able to prove properties in the presence of infinitely many paths.

Results

We have developed Antelope ("Analysis of Networks through TEmporal-LOgic sPEcifications", http://turing.iimas.unam.mx:8080/AntelopeWEB/), a model checker for analyzing and constructing Boolean GRNs. Currently, software systems for Boolean GRNs use branching time almost exclusively for asynchrony. Antelope, by contrast, also uses branching time for incompletely specified behavior and environment interaction. We show the usefulness of modeling these two phenomena in the development of a Boolean GRN of the Arabidopsis thaliana root stem cell niche.

There are two obstacles to a direct approach when applying model checking to Boolean GRN analysis. First, ordinary model checkers normally only verify whether or not a given set of model states has a given property. In comparison, a model checker for Boolean GRNs is preferable if it reports the set of states having a desired property. Second, for efficiency, the expressiveness of many model checkers is limited, resulting in the inability to express some interesting properties of Boolean GRNs.

Antelope tries to overcome these two drawbacks: Apart from reporting the set of all states having a given property, our model checker can express, at the expense of efficiency, some properties that ordinary model checkers (e.g., NuSMV) cannot. This additional expressiveness is achieved by employing a logic extending the standard Computation-Tree Logic (CTL) with hybrid-logic operators.

Conclusions

We illustrate the advantages of Antelope when (a) modeling incomplete networks and environment interaction, (b) exhibiting the set of all states having a given property, and (c) representing Boolean GRN properties with hybrid CTL.

"Immunetworks", intersecting circuits and dynamics

This paper proposes a study of biological regulation networks based on a multi-level strategy. Given a network, the first structural level of this strategy consists in analysing the architecture of the network interactions in order to describe it. The second dynamical level consists in relating the patterns found in the architecture to the possible dynamical behaviours of the network. It is known that circuits are the patterns that play the most important part in the dynamics of a network in the sense that they are responsible for the diversity of its asymptotic behaviours. Here, we pursue further this idea and argue that beyond the influence of underlying circuits, intersections of circuits also impact significantly on the dynamics of a network and thus need to be payed special attention to. For some genetic regulation networks involved in the control of the immune system ("immunetworks"), we show that the small number of attractors can be explained by the presence, in the underlying structures of these networks, of intersecting circuits that "inter-lock".

Efficient parameter search for qualitative models of regulatory networks using symbolic model checking

Motivation: Investigating the relation between the structure and behavior of complex biological networks often involves posing the question if the hypothesized structure of a regulatory network is consistent with the observed behavior, or if a proposed structure can generate a desired behavior.

Results: The above questions can be cast into a parameter search problem for qualitative models of regulatory networks. We develop a method based on symbolic model checking that avoids enumerating all possible parametrizations, and show that this method performs well on real biological problems, using the IRMA synthetic network and benchmark datasets. We test the consistency between IRMA and time-series expression profiles, and search for parameter modifications that would make the external control of the system behavior more robust.

Availability: GNA and the IRMA model are available at http://ibis.inrialpes.fr/

Contact:gregory.batt@inria.fr

Supplementary information:Supplementary data are available at Bioinformatics online.

Applications of a formal approach to decipher discrete genetic networks

Background

A growing demand for tools to assist the building and analysis of biological networks exists in systems biology. We argue that the use of a formal approach is relevant and applicable to address questions raised by biologists about such networks. The behaviour of these systems being complex, it is essential to exploit efficiently every bit of experimental information. In our approach, both the evolution rules and the partial knowledge about the structure and the behaviour of the network are formalized using a common constraint-based language.

Results

In this article our formal and declarative approach is applied to three biological applications. The software environment that we developed allows to specifically address each application through a new class of biologically relevant queries. We show that we can describe easily and in a formal manner the partial knowledge about a genetic network. Moreover we show that this environment, based on a constraint algorithmic approach, offers a wide variety of functionalities, going beyond simple simulations, such as proof of consistency, model revision, prediction of properties, search for minimal models relatively to specified criteria.

Conclusions

The formal approach proposed here deeply changes the way to proceed in the exploration of genetic and biochemical networks, first by avoiding the usual trial-and-error procedure, and second by placing the emphasis on sets of solutions, rather than a single solution arbitrarily chosen among many others. Last, the constraint approach promotes an integration of model and experimental data in a single framework.