CIRCULAR SUGGESTIONS FOR DNA COMPUTING

An introduction to DNA computing for non-specialists is given in a novel fashion. Wet lab solutions using circular double stranded DNA molecules are sketched for several classical algorithmic problems. Laboratory tests of these suggestions are in the initial stages.

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

[2]  D. Pixton.  Linear and circular splicing systems , 1995, Proceedings First International Symposium on Intelligence in Neural and Biological Systems. INBS'95.

[3]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[4]  U Gyllensten,et al.  In Molecular Biology and Biotechnology. A comprehensive desk reference. , 1995 .

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

[6]  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).

[7]  Nadia Pisanti,et al.  DNA Computing: A Survey , 1998, Bull. EATCS.

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

[9]  R. W. Gatterdam,et al.  On the undecidability of splicing systems , 1989 .

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

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

[12]  Harold N. Gabow,et al.  An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs , 1976, JACM.

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

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

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

[16]  Dennis Pixton,et al.  Splicing in abstract families of languages , 2000, Theor. Comput. Sci..