Computing Polynomials by Chemical Reaction Networks

Chemical reaction networks (CRNs) provide a fundamental model in the study of molecular systems. Widely used as formalism for the analysis of chemical and biochemical systems, CRNs have received renewed attention as a model for molecular computation. This paper demonstrates that, with a new encoding, CRNs can compute any set of polynomial functions subject only to the limitation that these functions must map the unit interval to itself. These polynomials can be expressed as linear combinations of Bernstein basis polynomials with positive coefficients less than or equal to 1. In the proposed encoding approach, each variable is represented using two molecular types: a type-0 and a type-1. The value is the ratio of the concentration of type-1 molecules to the sum of the concentrations of type-0 and type-1 molecules. The proposed encoding naturally exploits the expansion of a power-form polynomial into a Bernstein polynomials. The method is illustrated first for generic CRNs; then the chemical reactions designed for two examples are mapped to DNA strand-displacement reactions.

[1]  Rodolphe Sepulchre,et al.  Analysis of Interconnected Oscillators by Dissipativity Theory , 2007, IEEE Transactions on Automatic Control.

[2]  Ho-Lin Chen,et al.  Deterministic Function Computation with Chemical Reaction Networks , 2012, DNA.

[3]  Weikang Qian,et al.  Uniform approximation and Bernstein polynomials with coefficients in the unit interval , 2011, Eur. J. Comb..

[4]  Elisa Franco,et al.  A self-regulating biomolecular comparator for processing oscillatory signals , 2015, Journal of The Royal Society Interface.

[5]  David Eisenstat,et al.  Fast computation by population protocols with a leader , 2006, Distributed Computing.

[6]  D. Lathrop.  Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry, and Engineering , 2015 .

[7]  D. Gillespie.  Exact Stochastic Simulation of Coupled Chemical Reactions , 1977 .

[8]  Weikang Qian,et al.  The synthesis of robust polynomial arithmetic with stochastic logic , 2008, 2008 45th ACM/IEEE Design Automation Conference.

[9]  M. Magnasco.  CHEMICAL KINETICS IS TURING UNIVERSAL , 1997 .

[10]  Ho-Lin Chen,et al.  Rate-independent computation in continuous chemical reaction networks , 2014, ITCS.

[11]  Peter A. J. Hilbers,et al.  Computing Algebraic Functions with Biochemical Reaction Networks , 2009, Artificial Life.

[12]  Keshab K. Parhi,et al.  Markov chain computations using molecular reactions , 2015, 2015 IEEE International Conference on Digital Signal Processing (DSP).

[13]  Chrisantha Fernando,et al.  Turing Complete Catalytic Particle Computers , 2007, ECAL.

[14]  Péter Érdi,et al.  Mathematical Models of Chemical Reactions: Theory and Applications of Deterministic and Stochastic Models , 1989 .

[15]  Gentian Buzi,et al.  Glycolytic Oscillations and Limits on Robust Efficiency , 2011, Science.

[16]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[17]  Rida T. Farouki,et al.  On the numerical condition of polynomials in Bernstein form , 1987, Comput. Aided Geom. Des..

[18]  Keshab K. Parhi,et al.  Architectures for digital filters using stochastic computing , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[19]  R. Jackson,et al.  General mass action kinetics , 1972 .

[20]  Brian R. Gaines,et al.  Stochastic computing , 1967, AFIPS '67 (Spring).

[21]  Matthew Cook,et al.  Computation with finite stochastic chemical reaction networks , 2008, Natural Computing.

[22]  Pablo A. Iglesias,et al.  Control Theory and Systems Biology , 2009 .

[23]  Marc D. Riedel,et al.  Chemical Reaction Networks for Computing Polynomials. , 2017, ACS synthetic biology.

[24]  Erik Winfree,et al.  DNA as a universal substrate for chemical kinetics , 2009, Proceedings of the National Academy of Sciences.