Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

https://hal.inria.fr/hal-03271828
Contributor : François Fages Connect in order to contact the contributor
Submitted on : Sunday, June 27, 2021 - 5:28:23 PM
Last modification on : Wednesday, April 20, 2022 - 3:35:44 AM
Long-term archiving on: : Tuesday, September 28, 2021 - 11:03:01 PM

File

HFS21casc.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03271828, version 1

Citation

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⟩

Share

Metrics

Record views

69

Files downloads

96