Robust Biomolecular Finite Automata

We present a uniform method for translating an arbitrary nondeterministic finite automaton (NFA) into a deterministic mass action input/output chemical reaction network (I/O CRN) that simulates it. The I/O CRN receives its input as a continuous time signal consisting of concentrations of chemical species that vary to represent the NFA's input string in a natural way. The I/O CRN exploits the inherent parallelism of chemical kinetics to simulate the NFA in real time with a number of chemical species that is linear in the size of the NFA. We prove that the simulation is correct and that it is robust with respect to perturbations of the input signal, the initial concentrations of species, the output (decision), and the rate constants of the reactions of the I/O CRN.

[1]  Damien Pous,et al.  Hacking nondeterminism with induction and coinduction , 2015, Commun. ACM.

[2]  Irving R. Epstein,et al.  An Introduction to Nonlinear Chemical Dynamics: Oscillations, Waves, Patterns, and Chaos , 1998 .

[3]  Damien Woods.  Intrinsic universality and the computational power of self-assembly , 2013, MCU.

[4]  David Eisenstat,et al.  A simple population protocol for fast robust approximate majority , 2007, Distributed Computing.

[5]  Hao Yan,et al.  DNA Origami with Complex Curvatures in Three-Dimensional Space , 2011, Science.

[6]  Erik Winfree,et al.  A General-Purpose CRN-to-DSD Compiler with Formal Verification, Optimization, and Simulation Capabilities , 2017, DNA.

[7]  G. Seelig,et al.  Dynamic DNA nanotechnology using strand-displacement reactions. , 2011, Nature chemistry.

[8]  N. Seeman.  Nucleic acid junctions and lattices. , 1982, Journal of theoretical biology.

[9]  Shawn M. Douglas,et al.  A Logic-Gated Nanorobot for Targeted Transport of Molecular Payloads , 2012, Science.

[10]  D. Vecchio,et al.  Biomolecular Feedback Systems , 2014 .

[11]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[12]  P. Yin,et al.  Complex shapes self-assembled from single-stranded DNA tiles , 2012, Nature.

[13]  François Fages,et al.  Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs , 2017, CMSB.

[14]  Gábor Lente,et al.  Deterministic Kinetics in Chemistry and Systems Biology: The Dynamics of Complex Reaction Networks , 2015 .

[15]  Jehoshua Bruck,et al.  Programmability of Chemical Reaction Networks , 2009, Algorithmic Bioprocesses.

[16]  Titus H. Klinge,et al.  Robust Chemical Circuits , 2018, Biosyst..

[17]  Takashi Yokomori,et al.  The computational capability of chemical reaction automata , 2015, Natural Computing.

[18]  M. Sahani,et al.  Algorithmic Self-Assembly of DNA , 2006 .

[19]  Richard M. Murray,et al.  Feedback Systems An Introduction for Scientists and Engineers , 2007 .

[20]  Takashi Yokomori,et al.  The Computing Power of Determinism and Reversibility in Chemical Reaction Automata , 2018, Reversibility and Universality.

[21]  Jack H. Lutz,et al.  The Tile Assembly Model is Intrinsically Universal , 2011, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

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

[23]  Luca Cardelli,et al.  The Cell Cycle Switch Computes Approximate Majority , 2012, Scientific Reports.

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

[25]  T. Apostol.  Multi-variable calculus and linear algebra, with applications to differential equations and probability , 1969 .

[26]  P. Rothemund.  Folding DNA to create nanoscale shapes and patterns , 2006, Nature.

[27]  Thomas A. Henzinger,et al.  The equivalence problem for finite automata , 2015, Commun. ACM.

[28]  Luca Cardelli,et al.  Programmable chemical controllers made from DNA. , 2013, Nature nanotechnology.

[29]  Ruchuan Liu,et al.  Bipedal nanowalker by pure physical mechanisms. , 2012, Physical review letters.

[30]  Jehoshua Bruck,et al.  Neural network computation with DNA strand displacement cascades , 2011, Nature.

[31]  Luca Cardelli,et al.  Morphisms of reaction networks that couple structure to function , 2014, BMC Systems Biology.

[32]  Titus H. Klinge,et al.  Robust Signal Restoration in Chemical Reaction Networks , 2016, NANOCOM.

[33]  Lulu Qian,et al.  Supporting Online Material Materials and Methods Figs. S1 to S6 Tables S1 to S4 References and Notes Scaling up Digital Circuit Computation with Dna Strand Displacement Cascades , 2022 .

[34]  Lulu Qian,et al.  A Simple DNA Gate Motif for Synthesizing Large-Scale Circuits , 2008, DNA.

[35]  Matt A. King,et al.  Three-Dimensional Structures Self-Assembled from DNA Bricks , 2012 .

[36]  R. Aris.  Prolegomena to the rational analysis of systems of chemical reactions , 1965 .

[37]  A. Turberfield,et al.  A DNA-fuelled molecular machine made of DNA , 2022 .

[38]  Matthew J. A. Wood,et al.  DNA cage delivery to mammalian cells. , 2011, ACS nano.

[39]  Luvena L. Ong,et al.  Three-Dimensional Structures Self-Assembled from DNA Bricks , 2012, Science.

[40]  G. Seelig,et al.  DNA as a universal substrate for chemical kinetics , 2010, Proceedings of the National Academy of Sciences.

[41]  Chris Thachuk,et al.  DNA walker circuits: computational potential, design, and verification , 2013, Natural Computing.

[42]  Horst Alzer,et al.  On some inequalities for the incomplete gamma function , 1997, Math. Comput..

[43]  Damien Pous,et al.  Checking NFA equivalence with bisimulations up to congruence , 2013, POPL.

[44]  Dexter Kozen,et al.  Automata and Computability , 1997, Undergraduate Texts in Computer Science.

[45]  Adam H. Marblestone,et al.  Rapid prototyping of 3D DNA-origami shapes with caDNAno , 2009, Nucleic acids research.

[46]  Lloyd M. Smith.  Nanotechnology: Molecular robots on the move , 2010, Nature.

[47]  T. Sideris.  Ordinary Differential Equations and Dynamical Systems , 2013 .

[48]  J. Bauer,et al.  Chemical reaction network theory for in-silico biologists , 2003 .

[49]  David Eisenstat,et al.  The computational power of population protocols , 2006, Distributed Computing.