Compiling elementary mathematical functions into finite chemical reaction networks via a polynomialization algorithm for ODEs
From MaRDI portal
Publication:2142105
DOI10.1007/978-3-030-85633-5_5zbMath1491.92052arXiv2106.15884OpenAlexW3167456349MaRDI QIDQ2142105
François Fages, Mathieu Hemery, Sylvain Soliman
Publication date: 25 May 2022
Full work available at URL: https://arxiv.org/abs/2106.15884
Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08) Systems biology, networks (92C42)
Related Items (2)
On estimating derivatives of input signals in biochemistry ⋮ Algebraic biochemistry: a framework for analog online computation in cells
Cites Work
- Unnamed Item
- Unnamed Item
- Inferring reaction systems from ordinary differential equations
- Change-of-bases abstractions for non-linear hybrid systems
- Analog computers and recursive functions over the reals.
- Graphical requirements for multistationarity in reaction networks and their verification in BioModels
- On the complexity of quadratization for polynomial differential equations
- Optimal monomial quadratization for ODE systems
- Polynomial differential equations compute all real computable functions on computable compact intervals
- Abstract interpretation and types for systems biology
- Deterministic Function Computation with Chemical Reaction Networks
- Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs
- Multiple Equilibria in Complex Chemical Reaction Networks: II. The Species-Reaction Graph
- Mathematical Theory of the Differential Analyzer
This page was built for publication: Compiling elementary mathematical functions into finite chemical reaction networks via a polynomialization algorithm for ODEs
