Using DNA to solve the Bounded Post Correspondence Problem

Theoretical research in DNA computing includes designing practical experiments for solving various computational problems by means of DNA manipulation. This paper proposes a DNA algorithm for an NP-complete problem, The Bounded Post Correspondence Problem. The proposed experiment can be used to test several standard molecular biology laboratory procedures for their usability as bio-operations in DNA computing. c 2000 Elsevier Science B.V. All rights reserved.

[1]  Martyn Amos,et al.  Error-resistant implementation of DNA computations , 1996, DNA Based Computers.

[2]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[3]  Qinghua Liu,et al.  A surface-based approach to DNA computation , 1996, DNA Based Computers.

[4]  Gheorghe Paun,et al.  DNA COMPUTING BASED ON THE SPLICING OPERATION , 1996 .

[5]  John H. Reif,et al.  Parallel molecular computation , 1995, SPAA '95.

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

[7]  Lila Kari,et al.  Contextual Insertions/Deletions and Computability , 1996, Inf. Comput..

[8]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[11]  Erik Winfree,et al.  A Sticker-Based Model for DNA Computation , 1998, J. Comput. Biol..

[12]  Harvey Rubin,et al.  Looking for the DNA killer app , 1996, Nature Structural Biology.

[13]  John S. Oliver.  Computation with DNA: Matrix multiplication , 1996, DNA Based Computers.

[14]  Rudolf Freund,et al.  DNA Computing Based on Splicing: The Existence of Universal Computers , 1999, Theory of Computing Systems.

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

[16]  James B. Morris.  Formal Languages and their Relation to Automata , 1970 .

[17]  Masami Hagiya,et al.  Joining and rotating data with molecules , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

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

[19]  Lila Kari,et al.  From Micro-Soft to Bio-Soft: Computing With DNA , 1997, BCEC.

[20]  Paul W. K. Rothemund,et al.  A DNA and restriction enzyme implementation of Turing machines , 1995, DNA Based Computers.

[21]  J. Sambrook,et al.  Molecular Cloning: A Laboratory Manual , 2001 .

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

[23]  Donald Beaver,et al.  A universal molecular computer , 1995, DNA Based Computers.

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

[25]  R. Deaton,et al.  A DNA based implementation of an evolutionary search for good encodings for DNA computation , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[26]  N. Jonoska,et al.  Ligation experiments in computing with DNA , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[27]  Gheorghe Paun,et al.  At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems , 1997, DNA Based Computers.

[28]  Richard J. Lipton,et al.  Breaking DES using a molecular computer , 1995, DNA Based Computers.

[29]  Takashi Yokomori,et al.  DNA implementation of simple Horn clause computation , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[30]  P. Vincent,et al.  The Encyclopedia of Molecular Biology , 1995 .

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

[32]  Dan Boneh,et al.  Running dynamic programming algorithms on a DNA computer , 1996, DNA Based Computers.

[33]  F Guarnieri,et al.  Maya Blue Paint: An Ancient Nanostructured Material , 1996, Science.

[34]  David Harlan Wood,et al.  Massively parallel DNA computation: Expansion of symbolic determinants , 1996, DNA Based Computers.

[35]  D K Gifford,et al.  On the path to computation with DNA. , 1994, Science.

[36]  Erik Winfree,et al.  Complexity of restricted and unrestricted models of molecular computation , 1995, DNA Based Computers.

[37]  David Harlan Wood,et al.  Exascale computer algebra problems interconnect with molecular reactions and complexity theory , 1996, DNA Based Computers.

[38]  Warren D. Smith.  DNA computers in vitro and vivo , 1995, DNA Based Computers.

[39]  Guillermo A. Cecchi,et al.  DNA based molecular computation: Template-template interactions in PCR , 1996, DNA Based Computers.

[40]  Teri,et al.  Molecular Cloning A Laboratory Manual Second Edition Sambrook , 1989 .

[41]  Satoshi Kobayashi,et al.  On the power of circular splicing systems and DNA computability , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[42]  Richard J. Lipton,et al.  On the Computational Power of DNA , 1996, Discret. Appl. Math..

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

[44]  H. Sambrook.  Molecular cloning : a laboratory manual. Cold Spring Harbor, NY , 1989 .

[45]  Eleanor Lawrence,et al.  The encyclopedia of molecular biology , 1995 .

[46]  E B Baum,et al.  Building an associative memory vastly larger than the brain. , 1995, Science.

[47]  Natasa Jonoska,et al.  A molecular computation of the road coloring problem , 1996, DNA Based Computers.

[48]  Gheorghe Paun,et al.  DNA computing based on splicing: universality results. , 1996, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.

[49]  Satoshi Kobayashi,et al.  DNA-EC: A model of DNA-computing based on equality checking , 1997, DNA Based Computers.

[50]  Erik Winfree,et al.  On the computational power of DNA annealing and ligation , 1995, DNA Based Computers.

[51]  John H. Reif,et al.  Paradigms for Biomolecular Computation , 1998 .

[52]  Sartaj Sahni,et al.  On the Computational Complexity of Scheme Equivalence , 1974 .

[53]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

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