• English
    • français
  • Help
  •  | 
  • Contact
  •  | 
  • About
  •  | 
  • Login
  • HAL portal
  •  | 
  • Pages Pro
  • EN
  •  / 
  • FR
View Item 
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Abstract Simulation of Reaction Networks ...
  • BibTeX
  • CSV
  • Excel
  • RIS

Document type :
Communication dans un congrès avec actes
Title :
Abstract Simulation of Reaction Networks via Boolean Networks
Author(s) :
Niehren, Joachim [Auteur] refId
Linking Dynamic Data [LINKS]
BioComputing
Vaginay, Athénaïs [Auteur]
Computational Algorithms for Protein Structures and Interactions [CAPSID]
Versari, Cristian [Auteur] refId
BioComputing
Conference title :
CMSB2022: 20th International Conference on Computational Methods in Systems Biology
City :
Bucarest
Country :
Roumanie
Start date of the conference :
2022-09-14
Publisher :
Springer
English keyword(s) :
Systems biology
abstract interpretation
Sign abstraction
Reaction networks
Boolean networks
Logic
SBML
Constraint programming
HAL domain(s) :
Informatique [cs]/Bio-informatique [q-bio.QM]
Informatique [cs]
English abstract : [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 ...
Show more >
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 derivatives 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 prove the soundness of our abstract simulation algorithm, discuss its implementation, and show its applicability to reaction networks in the SBML format from the BioModels database.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Source :
Harvested from HAL
Files
Thumbnail
  • https://hal.archives-ouvertes.fr/hal-02279942v9/document
  • Open access
  • Access the document
Thumbnail
  • https://hal.archives-ouvertes.fr/hal-02279942v9/document
  • Open access
  • Access the document
Thumbnail
  • https://hal.archives-ouvertes.fr/hal-02279942v9/document
  • Open access
  • Access the document
Université de Lille

Mentions légales
Université de Lille © 2017