Skip to Main content Skip to Navigation

Abstractions de différences exactes de réseaux de réactions : Améliorer la précision de prédiction de changements de systèmes biologiques

Emilie Allart 1, 2
1 BioComputing
CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : Change predictions for reaction networks with partial kinetic information can be obtained by qualitative reasoning with abstract interpretation. A typical change prediction problem in systems biology is which gene knockouts may, or must, increase the outflow of a target species at steady state. Answering such questions for reaction networks requires to reason about abstract difference such as ``increases'' and ``decreases''. A task fundamental for change predictions was introduced by Niehren et al. (2016). It is the problem to compute for a given system of linear equations with nonlinear difference constraints, the difference abstraction of the set of its positive solutions. Previous approaches provided overapproximation algorithms for this task based on various heuristics, for instance by rewriting the linear equations. In this thesis, we present the first algorithms that can solve this task exactly for the two difference abstractions used in the literature so far. As a first contribution, we show how to characterize for a linear equation system the boolean abstraction of its set of positive solutions. This abstraction maps any strictly positive real numbers to 1 and 0 to 0. The characterization is given by the set of boolean solutions for another equation system, that we compute based on elementary modes. The boolean solutions of the characterizing equation system can then be computed based on finite domain constraint programming in practice. We believe that this result is relevant for the analysis of functional programs with linear arithmetics. As a second contribution, we present two algorithms that compute for a given system of linear equations and nonlinear difference constraints, the exact difference abstraction into Delta3 and Delta6 respectively. These algorithms rely on the characterization of boolean abstractions for linear equation systems from the first contribution. The bridge between these abstractions is defined in first-order logic. In this way, the difference abstraction can be computed by finite set constraint programming too. We implemented our exact algorithms and applied them to predicting gene knockouts that may lead to leucine overproduction in B.Subtilis, as needed for surfactin overproduction in biotechnology. Computing the precise predictions with the exact algorithm may take several hours though. Therefore, we also present new heuristics for computing difference abstraction based on elementary modes, that provides a good compromise between precision and time efficiency.
Complete list of metadata
Contributor : Emilie Allart Connect in order to contact the contributor
Submitted on : Wednesday, April 14, 2021 - 11:56:12 AM
Last modification on : Tuesday, January 4, 2022 - 6:50:59 AM
Long-term archiving on: : Thursday, July 15, 2021 - 6:23:21 PM


Files produced by the author(s)


  • HAL Id : tel-03197878, version 1


Emilie Allart. Abstractions de différences exactes de réseaux de réactions : Améliorer la précision de prédiction de changements de systèmes biologiques. Bio-informatique [q-bio.QM]. Université de Lille, 2021. Français. ⟨tel-03197878⟩



Les métriques sont temporairement indisponibles