DNA Computing primers and pointers

7 May 2002
...a few places to start...

Publications on DNA based Computers

Leiden Institute of Advanced Computer Science pages

World Wide DNA Computing, Computational Biology, and Molecular Computing

COMPUTING: Successes and Challenges (Science Volume 296, Number 5567, Issue of 19 Apr 2002, pp. 478-479) [ John H. Reif]
and
Solution of a 20-Variable 3-SAT Problem on a DNA Computer (Science Volume 296, Number 5567, Issue of 19 Apr 2002, pp. 499-502) [Ravinderjit S. Braich et al.]

Molecular Computation of Solutions to Combinatorial Problems (Science, 11 Nov 1994, pp. 1021-1024) Leonard M. Adleman --cited by 14 others in Web of Science search (1996-)

DNA Solution of Hard Computational Problems (Science Vol. 268, No. 5210, Apr. 28, 1995, pp. 542-545) [Richard J. Lipton] --cited by 100 others in WoS search

see also:
Molecular computation: RNA solutions to chess problems
Faulhammer D, Cukras AR, Lipton RJ, Landweber LF
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA
97 (4): 1385-1389 FEB 15 2000

Abstract:
We have expanded the field of "DNA computers" to RNA and present a general approach for the solution of satisfiability problems. As an example, we consider a variant of the "Knight problem," which asks generally what configurations of knights can one place on an n x n chess board such that no knight is attacking any other knight on the board. Using specific ribonuclease digestion to manipulate strands of a 10-bit binary RNA library, we developed a molecular algorithm and applied it to a 3 x 3 chessboard as a 9-bit instance of this problem. Here, the nine spaces on the board correspond to nine "bits" or placeholders in a combinatorial RNA library. We recovered a set of "winning" molecules that describe solutions to this problem.

Using three-dimensional microfluidic networks for solving computationally hard problems (Proc. Natl. Acad. Sci. USA, Vol. 98, Issue 6, 2961-2966, March 13, 2001) Daniel T. Chiu et al.

DNA Computing (The Indian Programmer, June 2001) [Gaurav Gupta et al.])

9 May
An excerpt from Digital Biology: how nature is transforming our technology and our lives (Peter J. Bentley, Simon & Schuster [QH324.2 .B46 2001]):

DNA computers are possible only because of the impressive array of techniques we now possess to manipulate, read, and create DNA molecules... Instead of storing information as electronic 1s and 0s within silicon chips, DNA computers actually use synthetic strands of DNA to store information... Instead of generating one solution at a time and checking it, a DNA computer would generate trillions of solutions at a time, each one defined by a slightly different strand of DNA. It might be possible to generate DNA molecules (either in a test tube or attached to a gold-coated square of glass) that correspond to every possible solution to the problem... Special enzymes are introduced, which alter the DNA molecules according to their pattern of bases. So, for example, enzymes might add a short base sequence if two specific patterns occurred somewhere in the DNA molecule. By using many of these operations, the enzymes can be used to perform logical and mathematical functions... they can also be used to destroy any DNA molecules that represent invalid solutions... When the chemical reactions are finished, the best solutions can be picked by extracting the remaining DNA strands. These can be decoded using the same DNA fingerprinting techniques used by police to identify criminals... Right now we do not have the technology to automate the large-scale synthesis of specific DNA molecules. The process of decoding the DNA is also still too slow... (pp. 224-226)