• Aucun résultat trouvé

A Hoare logic for gene regulatory networks

N/A
N/A
Info
Télécharger
Protected

Academic year: 2022

Partager "A Hoare logic for gene regulatory networks"

Copied!
1
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

(1)

2nd Workshop on Computational Structural Biology:

Integrative Approaches for Modeling Biomolecular Complexes 2013 Nice, FRANCE, May 29-31, 2013

A Hoare logic for gene regulatory networks

Jean-Paul COMET* and Gilles BERNOT

When modelling gene regulatory networks, we face the important issue of parameter identification, even if we consider the purely discrete framework introduced by René Thomas. Here, we focus on the exhaustive search of all the parameter values that are consistent with the observed behavior of the gene network. After having sketched the logical framework of René Thomas for modelling gene regulatory networks, we introduce a new approach based on Hoare logic and weakest precondition calculus to generate constraints on possible parameter values. The observed behaviors are first represented by sequences of elementary moves and so they play the role of ''programs'' of the classical Hoare logic.

The backward strategy of the Hoare logic allows one to compute the weakest preconditions underwhich the execution of the program leads to a state where the post-conditions are satisfied. These preconditions represent the sets of all compatible parametrizations expressed as constraints on the parameters.

Corresponding Author:

Jean-Paul COMET,

University of Nice-Sophia Antipolis Lab I3S – CNRS UMR 7271

Références

Télécharger maintenant ( PDF - 1 Page - 33.48 KB )

Documents relatifs

Structural geology and petrography of the Naret region (northern Valle Maggia, N.Ticino, Switzerland)

large isoclinal folds with crystalline cores surrounded by Mesozoic rocks (e.g. Overprint by subsequent deformation phases makes the determination of the original D 1 -fold

Modeling and Analysis of Gene Regulatory Networks

Thomas’ logical method consists in modeling the qualitative behavior of a gene network under the form of a finite state transition graph.. This state transition graph is built from

Gene Regulatory Networks: Introduction of multiplexes into R. Thomas’ modelling

Under the Snoussi’s hy- potheses (see section 3 Biological Regulatory Networks with multiplexes) and for a given logical formula, all possible parameter settings in our framework

A Framework for Scalable Inference of Temporal Gene Regulatory Networks based on Clustering and Multivariate Analysis

After the clustering step, we set each gene of the N genes of the input dataset as the target gene, and then we performed an exhaustive search that evaluates all possible subsets

Simulation of Gene Regulatory Networks

Macroscopic scale: when stochastic fluctuations are neglected, the quantities of molecu- les are viewed as derivable functions of time, solution of a system of ODE’s, called

A Hoare Logic for Call-by-Value Functional Programs

We present a Hoare logic for a call-by-value programming language equipped with recursive, higher-order functions, algebraic data types, and a polymorphic type system in the style

A Problog Model for Analyzing Gene Regulatory Networks

We introduce logic-based regulation models based on state-of-the-art work on statistical relational learning, to show that net- work hypotheses can be generated from existing

A Termination Checker for Isabelle Hoare Logic

Although we can use the termination tool to generate WF relations for all cyclic paths, these relations cannot be used as variants for Hoare logic.. First, there may be nested