A Polynomialization Algorithm for Elementary Functions and ODEs, and their Compilation into Chemical Reaction Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

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

Abstract

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 polynomial differential equations (PODE). This algorithm is used as a front-end transformation in a pipeline to compile any elementary mathematical function, either of time or of some input variable, into a finite Chemical Reaction Network (CRN) which computes it. We illustrate the performance of our compiler on a benchmark of elementary functions which serve as formal specification of CRN design problems in synthetic biology, and as comparison basis with natural CRNs exhibiting similar behaviours.
Fichier principal
Vignette du fichier
HFS21casc.pdf (338.42 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03271828 , version 1 (27-06-2021)

Identifiers

  • HAL Id : hal-03271828 , version 1

Cite

Mathieu Hemery, François Fages, Sylvain Soliman. A Polynomialization Algorithm for Elementary Functions and ODEs, and their Compilation into Chemical Reaction Networks. CASC'21 - Computer Algebra in Scientific Computing., Sep 2021, Sochi, Russia. ⟨hal-03271828⟩
94 View
121 Download

Share

Gmail Mastodon Facebook X LinkedIn More