Paper-Conference

On the Trap Space Semantics of Normal Logic Programs

The logical semantics of normal logic programs has traditionally been based on the notions of Clark’s completion and two-valued or three-valued canonical models, including …

Van-Giang Trinh
Read more

DigiDermA: Modeling Cellular and Molecular Interactions in Atopic Dermatitis

We analyzed publicly available single-cell RNA sequencing data (GEO accession GSE147424) derived from human skin biopsies of lesional and non-lesional atopic dermatitis samples …

Ouissem Saidi
Read more

Graphical conditions for the existence, unicity and number of regular models

The regular models of a normal logic program are a particular type of partial (i.e. 3-valued) models which correspond to stable partial models with minimal undefinedness. In this …

Van-Giang Trinh
Read more

On BIOCHAM Symbolic Computation Pipeline for Compiling Mathematical Functions into Biochemistry

Chemical Reaction Networks (CRNs) are a standard formalism used in chemistry and biology to model complex molecular interaction systems. In the perspective of systems biology, …

François Fages
Read more

Scalable Enumeration of Trap Spaces in Boolean Networks via Answer Set Programming

Boolean Networks (BNs) are widely used as a modeling formalism in several domains, notably systems biology and computer science. A fundamental problem in BN analysis is the …

Giang Trinh
Read more

Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming

Boolean Networks (BNs) are an efficient modeling formalism with applications in various research fields such as mathematics, computer science, and more recently systems biology. …

Van-Giang Trinh
Read more

Minimal trap spaces of Logical models are maximal siphons of their Petri net encoding

Boolean modelling of gene regulation but also of post-transcriptomic systems has proven over the years that it can bring powerful analyses and corresponding insight to the many …

Van-Giang Trinh
Read more

Compiling Elementary Mathematical Functions into Finite Chemical Reaction Networks via a Polynomialization Algorithm for ODEs

The Turing completeness result for continuous chemical reaction networks (CRN) shows that any computable function over the real numbers can be computed by a CRN over a finite set …

Mathieu Hemery
Read more

A Polynomialization Algorithm for Elementary Functions and ODEs, and their Compilation into Chemical Reaction Networks

In this short paper extracted from [7], we present a polynomialization algorithm of quadratic time complexity to transform a system of elementary differential equations in …

Mathieu Hemery
Read more

On the Complexity of Quadratization for Polynomial Differential Equations

Chemical reaction networks (CRNs) are a standard formalism used in chemistry and biology to reason about the dynamics of molecular interaction networks. In their interpretation by …

Mathieu Hemery
Read more

Graphical Conditions for Rate Independence in Chemical Reaction Networks

Chemical Reaction Networks (CRNs) provide a useful abstraction of molecular interaction networks in which molecular structures as well as mass conservation principles are …

Elisabeth Degrand
Read more

On Inferring Reactions from Data Time Series by a Statistical Learning Greedy Heuristics

With the automation of biological experiments and the increase of quality of single cell data that can now be obtained by phospho-proteomic and time lapse videomicroscopy, …

Julien Martinelli
Read more

A Statistical Unsupervised Learning Algorithm for Inferring Reaction Networks from Time Series Data

With the automation of biological experiments and the increase of quality of single cell data that can now be obtained by phosphoproteomic and time lapse videomicroscopy, …

Julien Martinelli
Read more

On Robustness Computation and Optimization in BIOCHAM-4

BIOCHAM-4 is a tool for modeling, analyzing and synthesizing biochemical reaction networks with respect to some formal, yet possibly imprecise, specification of their behavior. We …

François Fages
Read more

Executable Disease Networks: Adding dynamics to molecular maps

Poster

Vidisha Singh Et Al
Read more

Probably Approximately Correct Learning of Regulatory Networks from Time-Series Data

Automating the process of model building from experimental data is a very desirable goal to palliate the lack of modellers for many applications. However, despite the spectacular …

Arthur Carcano
Read more

Model-based Investigation of the Circadian Clock and Cell Cycle Coupling in Mouse Embryonic Fibroblasts: Prediction of RevErb-α Up-regulation During Mitosis

Experimental observations have put in evidence autonomous self-sustained circadian oscillators in most mammalian cells, and proved the existence of molecular links between the …

Pauline Traynard
Read more

Influence Systems vs Reaction Systems

In Systems Biology, modelers develop more and more reaction-based models to describe the mechanistic biochemical reactions underlying cell processes. They may also work, however, …

François Fages
Read more

Model-based Investigation of the Effect of the Cell Cycle on the Circadian Clock through Transcription Inhibition during Mitosis

Experimental observations have put in evidence autonomous self-sustained circadian oscillators in most mammalian cells, and proved the existence of molecular links between the …

Pauline Traynard
Read more

Search by Constraint Propagation

Constraint programming is traditionally viewed as the combination of two components: a constraint model and a search procedure. In this paper we show that tree search procedures …

Thierry Martinez
Read more