Trends in computing with DNA

As an emerging new research area, DNA computation, or more generally biomolecular computation, extends into other fields such as nanotechnology and material design, and is developing into a new sub-discipline of science and engineering. This paper provides a brief survey of some concepts and developments in this area. In particular several approaches are described for biomolecular solutions of the satisfiability problem (using bit strands, DNA tiles and graph self-assembly). Theoretical models such as the primer splicing systems as well as the recent model of forbidding and enforcing are also described. We review some experimental results of self-assembly of DNA nanostructures and nanomechanical devices as well as the design of an autonomous finite state machine.

[1]  John S. McCaskill,et al.  Cascadable Hybridisation Transfer of Specific DNA between Microreactor Selection Modules , 2001, DNA.

[2]  N. Jonoska,et al.  Three dimensional DNA structures in computing. , 1999, Bio Systems.

[3]  K. Struhl,et al.  Current Protocols in Molecular Biology (New York: Greene Publishing Associates and Wiley-Interscience). Host-Range Shuttle System for Gene Insertion into the Chromosomes of Gram-negative Bacteria. , 1988 .

[4]  Erik Winfree,et al.  DNA Based Computers V , 2000 .

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

[6]  N. Seeman,et al.  Topological transformations of synthetic DNA knots. , 1995, Biochemistry.

[7]  Natasa Jonoska,et al.  Boundary Components of Thickened Graphs , 2001, DNA.

[8]  N. Seeman,et al.  Designed Two-Dimensional DNA Holliday Junction Arrays Visualized by Atomic Force Microscopy , 1999 .

[9]  J. Reif,et al.  Construction, analysis, ligation, and self-assembly of DNA triple crossover complexes , 2000 .

[10]  Erik Winfree,et al.  Universal computation via self-assembly of DNA: Some theory and experiments , 1996, DNA Based Computers.

[11]  David Harlan Wood,et al.  A PCR-based Protocol for In Vitro Selection of Non-crosshybridizing Oligonucleotides , 2002, DNA.

[12]  T. Head.  Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. , 1987, Bulletin of mathematical biology.

[13]  Masanori Arita,et al.  Solid phase DNA solution to the Hamiltonian path problem , 1997, DNA Based Computers.

[14]  Natasa Jonoska,et al.  Computation by Self-assembly of DNA Graphs , 2004, Genetic Programming and Evolvable Machines.

[15]  N. Seeman.  De novo design of sequences for nucleic acid structural engineering. , 1990, Journal of biomolecular structure & dynamics.

[16]  N. Seeman,et al.  Design and self-assembly of two-dimensional DNA crystals , 1998, Nature.

[17]  Tom Head,et al.  Splicing Systems: Regularity and Below , 2002, DNA.

[18]  L F Landweber,et al.  Molecular computation: RNA solutions to chess problems , 2000, Proc. Natl. Acad. Sci. USA.

[19]  Takashi Yokomori,et al.  On the computational power of insertion-deletion systems , 2004, Natural Computing.

[20]  David Harlan Wood,et al.  DNA Based Computers III , 1999 .

[21]  Natasa Jonoska,et al.  Forbidding and enforcing in membrane computing , 2004, Natural Computing.

[22]  Stefano Longhi.  Spiral waves in optical parametric oscillators , 2001 .

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

[24]  J. Reif,et al.  Logical computation using algorithmic self-assembly of DNA triple-crossover molecules , 2000, Nature.

[25]  Richard J. Lipton,et al.  DNA Based Computers , 1996 .

[26]  N C Seeman,et al.  Gel electrophoretic analysis of DNA branched junctions , 1989, Electrophoresis.

[27]  N. Seeman,et al.  A robust DNA mechanical device controlled by hybridization topology , 2002, Nature.

[28]  Nadrian C. Seeman,et al.  A specific quadrilateral synthesized from DNA branched junctions , 1989 .

[29]  R J Lipton,et al.  DNA solution of hard computational problems. , 1995, Science.

[30]  Tom Head,et al.  Splicing Schemes and DNA , 1992 .

[31]  Hao Wang.  Notes on a class of tiling problems , 1975 .

[32]  Lila Kari,et al.  Coding Properties of DNA Languages , 2001, DNA.

[33]  Eric B. Baum,et al.  DNA Based Computers II , 1998 .

[34]  Grzegorz Rozenberg,et al.  String Tile Models for DNA Computing by Self-Assembly , 2000, DNA Computing.

[35]  L. Karl.  DNA computing: Arrival of biological mathematics , 1997 .

[36]  Gheorghe Paun,et al.  Language Theory and Molecular Genetics: Generative Mechanisms Suggested by DNA Recombination , 1997, Handbook of Formal Languages.

[37]  Juris Hartmanis,et al.  On the Weight of Computations , 1995, Bull. EATCS.

[38]  John S. McCaskill,et al.  DNA Computing in Microreactors , 2001, DNA.

[39]  Andrzej Ehrenfeucht,et al.  Forbidding-enforcing systems , 2003, Theor. Comput. Sci..

[40]  Gheorghe Paun,et al.  Computing by Splicing , 1996, Theor. Comput. Sci..

[41]  Gheorghe Paun,et al.  On the power of the splicing operation , 1995, Int. J. Comput. Math..

[42]  Gheorghe Paun,et al.  Simulation Algorithms for Computational Systems Biology , 2017, Texts in Theoretical Computer Science. An EATCS Series.

[43]  N. Seeman.  DNA in a material world , 2003, Nature.

[44]  Leonard M. Adleman,et al.  Counting Rational Points on Curves and Abelian Varieties over Finite Fields , 1996, ANTS.

[45]  N. Cozzarelli,et al.  Biochemical topology: applications to DNA recombination and replication. , 1986, Science.

[46]  Kalpana Mahalingam,et al.  Languages of DNA Based Code Words , 2003, DNA.

[47]  John S. McCaskill,et al.  Steady Flow Micro-Reactor Module for Pipelined DNA Computations , 2000, DNA Computing.

[48]  Erik Winfree,et al.  On applying molecular computation to the data encryption standard , 1999, DNA Based Computers.

[49]  N. Seeman,et al.  Assembly of Borromean rings from DNA , 1997, Nature.

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

[51]  Gheorghe Paun,et al.  DNA Computing: New Computing Paradigms , 1998 .

[52]  Leonard M. Adleman,et al.  On constructing a molecular computer , 1995, DNA Based Computers.

[53]  Evan Drumwright,et al.  Virtual test tubes: a new methodology for computing , 2000, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000.

[54]  Natasa Jonoska,et al.  Creating 3-dimensional graph structures with DNA , 1997, DNA Based Computers.

[55]  Wolfgang Banzhaf,et al.  DNASequencesGenerator: A Program for the Construction of DNA Sequences , 2001, DNA.

[56]  E. Shapiro,et al.  Programmable and autonomous computing machine made of biomolecules , 2001, Nature.

[57]  Nadrian C. Seeman,et al.  The design of single-stranded nucleic acid knots , 1992 .

[58]  Masami Hagiya,et al.  Towards parallel evaluation and learning of Boolean μ-formulas with molecules , 1997, DNA Based Computers.

[59]  Grzegorz Rozenberg,et al.  Watson—Crick Automata , 1998 .

[60]  N. Seeman,et al.  Synthesis from DNA of a molecule with the connectivity of a cube , 1991, Nature.

[61]  Nadrian C. Seeman,et al.  Construction of DNA Polyhedra and Knots Through Symmetry Minimization , 1995 .

[62]  Hui Wang,et al.  The perils of polynucleotides: The experimental gap between the design and assembly of unusual DNA structures , 1996, DNA Based Computers.

[63]  Clifford R. Johnson,et al.  Solution of a 20-Variable 3-SAT Problem on a DNA Computer , 2002, Science.

[64]  Bernard Yurke,et al.  Operation of a Purified DNA Nanoactuator , 2001, DNA.

[65]  E. Winfree.  Whiplash PCR for O(1) Computing , 1998 .

[66]  Antonio Restivo,et al.  A Characterization of Strictly Locally Testable Languages and Its Applications to Subsemigroups of a Free Semigroup , 1980, Inf. Control..

[67]  Jules Moreau,et al.  Molecular Computation by DNA Hairpin Formation , 2000 .

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

[69]  P D Kaplan,et al.  DNA solution of the maximal clique problem. , 1997, Science.

[70]  F. Simmel,et al.  Using DNA to construct and power a nanoactuator. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.