We survey the theoretical use of DNA computing to solve intractable problems. We also discuss the relationship between problems in DNA computing and questions in complexity theory.

Kalpana Mahalingam Indian Institute of Technology 31.

This paper presents a DNA based classification technique. It exploits the properties of the DNA as a quaternary logic with the advantages of better storage, better accuracy, and shorter time compared to binary logic. Several examples are employed to demonstrate using the DNA as a new classification method for differentiation between closely related objects such as boys and girls also we used ne...

We present a method of transforming an extract-based DNA computation that is error-prone into one that is relatively error-free. These improvements in error rates are achieved without the supposition of any improvements in the reliability of the underlying laboratory techniques. We assume that only two types of errors are possible: a DNA strand may be incorrectly processed or it may be lost ent...

The concise algorithm by which protein functions are encoded in DNA sequences, and the flexible and adaptable operating systems of biological organisms, have long been coveted by computer scientists. Similarly, the information storage capacity of computers and their extraordinary problem-solving speed have been the envy of biologists. The parallels between the two systems are many, and it would...

The intersection of computer science and molecular biology is a fertile ground for new and exciting science. Two notable examples of this are molecular computing and molecular programming. Molecular computing is the use of molecules, and typically biological molecules, to create programmable autonomous computing devices1–7. Whereas molecular programming is the use of computer programming langua...

In 1994 Adleman published the description of a lab experiment, where he computed an instance of the Hamiltonian path problem with DNA in test tubes. He initiated a flood of further research on computing with molecular means in theoretical computer science. A great number of models was introduced and examined, concerning their computional power (universality as well as time and space complexity)...

Synthetic biology is a growing interdisciplinary field, with far-reaching applications, which aims to design biochemical systems that behave in a desired manner. With the advancement of strand-displacement DNA computing, a large class of abstract biochemical networks may be physically realized using DNA molecules. Methods for systematic design of the abstract systems with prescribed behaviors h...

We report on extensions to a Java distributed computation library (JDCL) by Fritsche, Power, and Waldron, with application to a problem in the field of bioinformatics. Within our framework the system has been extended to support applications requiring a MIMD (multiple instruction, multiple data) architecture. The system has been evaluated through a DNA pattern matching application over a networ...