Abstract Simulation of Reaction Networks ...
Type de document :
Pré-publication ou Document de travail
URL permanente :
Titre :
Abstract Simulation of Reaction Networks via Boolean Networks
Auteur(s) :
Niehren, Joachim [Auteur]
BioComputing
Linking Dynamic Data [LINKS]
Vaginay, Athénaïs [Auteur]
Computational Algorithms for Protein Structures and Interactions [CAPSID]
Versari, Cristian [Auteur]
Université de Lille
BioComputing
BioComputing
Linking Dynamic Data [LINKS]
Vaginay, Athénaïs [Auteur]
Computational Algorithms for Protein Structures and Interactions [CAPSID]
Versari, Cristian [Auteur]
Université de Lille
BioComputing
Mot(s)-clé(s) en anglais :
SBML
Logic
Boolean networks
Reaction networks
Sign abstraction
abstract interpretation
Linear equation systems
Systems biology
Logic
Boolean networks
Reaction networks
Sign abstraction
abstract interpretation
Linear equation systems
Systems biology
Discipline(s) HAL :
Informatique [cs]/Bio-informatique [q-bio.QM]
Informatique [cs]
Informatique [cs]
Résumé en anglais : [en]
We propose to simulate chemical reaction networks with the deterministic semantics abstractly, without any precise knowledge on the initial concentrations. For this, the concentrations of species are abstracted to booleans ...
Lire la suite >We propose to simulate chemical reaction networks with the deterministic semantics abstractly, without any precise knowledge on the initial concentrations. For this, the concentrations of species are abstracted to booleans stating whether the species is present or absent, and the derivations of the concentrations are abstracted to signs saying whether the concentration is increasing, decreasing, or unchanged. We use abstract interpretation over the structure of signs for mapping the ODEs of a reaction network to a boolean network with nondeterministic updates. The abstract state transition graph of such boolean networks can be computed by finite domain constraint programming over the finite structure of signs. Constraints on the abstraction of the initial concentrations can be added naturally, leading to an abstract simulation algorithm that produces only the part of the abstract state transition graph that is reachable from the abstraction of the initial state. We proof the soundness of our abstract simulation algorithm, discuss how we implemented it, illustrate it usefulness for exact reasoning, and show its applicability to reaction networks in SBML format from the BioModels database.Lire moins >
Lire la suite >We propose to simulate chemical reaction networks with the deterministic semantics abstractly, without any precise knowledge on the initial concentrations. For this, the concentrations of species are abstracted to booleans stating whether the species is present or absent, and the derivations of the concentrations are abstracted to signs saying whether the concentration is increasing, decreasing, or unchanged. We use abstract interpretation over the structure of signs for mapping the ODEs of a reaction network to a boolean network with nondeterministic updates. The abstract state transition graph of such boolean networks can be computed by finite domain constraint programming over the finite structure of signs. Constraints on the abstraction of the initial concentrations can be added naturally, leading to an abstract simulation algorithm that produces only the part of the abstract state transition graph that is reachable from the abstraction of the initial state. We proof the soundness of our abstract simulation algorithm, discuss how we implemented it, illustrate it usefulness for exact reasoning, and show its applicability to reaction networks in SBML format from the BioModels database.Lire moins >
Langue :
Anglais
Collections :
Source :
Date de dépôt :
2022-05-18T02:08:23Z
Fichiers
- https://hal.archives-ouvertes.fr/hal-02279942v8/document
- Accès libre
- Accéder au document