A service-oriented architecture for integrating the modeling and formal verification of genetic regulatory networks

Verifiable biology

The formalization of biological systems using computational modelling approaches as an alternative to mathematical-based methods has recently received much interest because computational models provide a deeper mechanistic understanding of biological systems. In particular, formal verification, complementary approach to standard computational techniques such as simulation, is used to validate the system correctness and obtain critical information about system behaviour. In this study, we survey the most frequently used computational modelling approaches and formal verification techniques for computational biology. We compare a number of verification tools and software suites used to analyse biological systems and biochemical networks, and to verify a wide range of biological properties. For users who have no expertise in formal verification, we present a novel methodology that allows them to easily apply formal verification techniques to analyse their biological or biochemical system of interest.

Qualitative Modeling, Analysis and Control of Synthetic Regulatory Circuits

Qualitative modeling approaches are promising and still underexploited tools for the analysis and design of synthetic circuits. They can make predictions of circuit behavior in the absence of precise, quantitative information. Moreover, they provide direct insight into the relation between the feedback structure and the dynamical properties of a network. We review qualitative modeling approaches by focusing on two specific formalisms, Boolean networks and piecewise-linear differential equations, and illustrate their application by means of three well-known synthetic circuits. We describe various methods for the analysis of state transition graphs, discrete representations of the network dynamics that are generated in both modeling frameworks. We also briefly present the problem of controlling synthetic circuits, an emerging topic that could profit from the capacity of qualitative modeling approaches to rapidly scan a space of design alternatives.

Pragmatic Sensory Data Semantics With Service-Oriented Computing

The importance of an architectural semantic for service-oriented computing starts with the characteristics of software systems that has been recognized with sharing and the utilization of resources. However, an architectural characteristic for service-oriented based applications depends on interaction patterns that utilizes a data format in communication. These patterns also help in establishing communication between service components. The goal of service-oriented computing methodologies could be achieved by adopting a logical separation of services from the actual mechanism of resource assignment and allotment. This shows that how services are reliable as interaction patterns between service provider and requester. It generates the binding patterns between these two and establishes communication between them. This article discusses the mathematical-based semantic model that presents an architectural view for systems that follows a service-oriented computing methodology. It also briefs describes about different execution states and routes, which addresses the service specifications in service-oriented computing.

Pluralistic and stochastic gene regulation: examples, models and consistent theory

We present a theory of pluralistic and stochastic gene regulation. To bridge the gap between empirical studies and mathematical models, we integrate pre-existing observations with our meta-analyses of the ENCODE ChIP-Seq experiments. Earlier evidence includes fluctuations in levels, location, activity, and binding of transcription factors, variable DNA motifs, and bursts in gene expression. Stochastic regulation is also indicated by frequently subdued effects of knockout mutants of regulators, their evolutionary losses/gains and massive rewiring of regulatory sites. We report wide-spread pluralistic regulation in ≈800 000 tightly co-expressed pairs of diverse human genes. Typically, half of ≈50 observed regulators bind to both genes reproducibly, twice more than in independently expressed gene pairs. We also examine the largest set of co-expressed genes, which code for cytoplasmic ribosomal proteins. Numerous regulatory complexes are highly significant enriched in ribosomal genes compared to highly expressed non-ribosomal genes. We could not find any DNA-associated, strict sense master regulator. Despite major fluctuations in transcription factor binding, our machine learning model accurately predicted transcript levels using binding sites of 20+ regulators. Our pluralistic and stochastic theory is consistent with partially random binding patterns, redundancy, stochastic regulator binding, burst-like expression, degeneracy of binding motifs and massive regulatory rewiring during evolution.

In silico implementation of synthetic gene networks

Computational synthetic biology has borrowed methods, concepts, and techniques from systems biology and electrical engineering. Features of tools for the analysis of biochemical networks and the design of electric circuits have been combined to develop new software, where Standard Biological Parts (physically stored at the MIT Registry) have a mathematical description, based on mass action or Hill kinetics, and can be assembled into genetic networks in a visual, "drag & drop" fashion. Recent tools provide the user with databases, simulation environments, formal languages, and even algorithms for circuit automatic design to refine and speed up gene network construction. Moreover, advances in automation of DNA assembly indicate that synthetic biology software soon will drive the wet-lab implementation of DNA sequences.

Genetic network analyzer: a tool for the qualitative modeling and simulation of bacterial regulatory networks

Genetic Network Analyzer (GNA) is a tool for the qualitative modeling and simulation of gene regulatory networks, based on so-called piecewise-linear differential equation models. We describe the use of this tool in the context of the modeling of bacterial regulatory networks, notably the network of global regulators controlling the adaptation of Escherichia coli to carbon starvation conditions. We show how the modeler, by means of GNA, can define a regulatory network, build a model of the network, determine the steady states of the system, perform a qualitative simulation of the network dynamics, and analyze the simulation results using model-checking tools. The example illustrates the interest of qualitative approaches for the analysis of the dynamics of bacterial regulatory 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.

Qualitative modelling and formal verification of the FLR1 gene mancozeb response in Saccharomyces cerevisiae

BACKGROUND

Qualitative models allow understanding the relation between the structure and the dynamics of gene regulatory networks. The dynamical properties of these models can be automatically analysed by means of formal verification methods, like model checking. This facilitates the model-validation process and the test of new hypotheses to reconcile model predictions with the experimental data.

RESULTS

The authors report in this study the qualitative modelling and simulation of the transcriptional regulatory network controlling the response of the model eukaryote Saccharomyces cerevisiae to the agricultural fungicide mancozeb. The model allowed the analysis of the regulation level and activity of the components of the gene mancozeb-induced network controlling the transcriptional activation of the FLR1 gene, which is proposed to confer multidrug resistance through its putative role as a drug eflux pump. Formal verification analysis of the network allowed us to confront model predictions with the experimental data and to assess the model robustness to parameter ordering and gene deletion.

CONCLUSIONS

This analysis enabled us to better understand the mechanisms regulating the FLR1 gene mancozeb response and confirmed the need of a new transcription factor for the full transcriptional activation of YAP1. The result is a computable model of the FLR1 gene response to mancozeb, permitting a quick and cost-effective test of hypotheses prior to experimental validation.