Compiling Elementary Mathematical Functions into Finite Chemical Reaction Networks via a Polynomialization Algorithm for ODEs
Compiling Elementary Mathematical Functions into Finite Chemical Reaction Networks via a Polynomialization Algorithm for ODEs
复制标题
通过常微分方程多项式化算法将基本数学函数编译为有限化学反应网络
DOI:
--
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
S. Soliman
中科院分区:
文献类型:
--
作者:
Mathieu Hemery;Franccois Fages;S. Soliman
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 of formal molecular species using at most bimolecular reactions with mass action law kinetics. The proof uses a previous result of Turing completeness for functions defined by polynomial ordinary differential equations (PODE), the dualrail encoding of real variables by the difference of concentration between two molecular species, and a back-end quadratization transformation to restrict to elementary reactions with at most two reactants. In this paper, we present a polynomialization algorithm of quadratic time complexity to transform a system of elementary differential equations to PODE. This algorithm is used as a front-end transformation to compile any elementary mathematical function, either of time or of some input species, into a finite CRN. We illustrate the performance of our compiler on a benchmark of elementary functions relevant to CRN design problems in synthetic biology specified by mathematical functions. In particular, the abstract CRN obtained by compilation of the Hill function of order 5 is compared to the natural CRN structure of MAPK signalling networks.
DOI:
10.1073/pnas.93.19.10078
发表时间:
1996-09-17
影响因子:
11.1
作者:
Huang, CYF;Ferrell, JE
通讯作者:
Ferrell, JE