The fledgling field of DNA computers began in 1994 when Leonard Adleman surprised the scientific community by using DNA molecules, protein enzymes, and chemicals to solve an instance of a hard computational problem. This volume presents results from the second annual meeting on DNA computers held at Princeton only one and one-half years after Adleman's discovery. By drawing on the analogy between DNA computing and cutting-edge fields of biology (such as directed evolution), this volume highlights some of the exciting progress in the field and builds a strong foundation for the theory of molecular computation. DNA computing is a radically different approach to computing that brings together computer science and molecular biology in a way that is wholly distinct from other disciplines. This book outlines important advances in the field and offers comprehensive discussion on potential pitfalls and the general practicality of building DNA based computers.
A sticker based model for DNA computation by S. Roweis, E. Winfree, R.
Burgoyne, N. V. Chelyapov, M. F. Goodman, P. W. K. Rothemund, and L. M.
Adleman On applying molecular computation to the data encryption standard by
L. M. Adleman, P. W. K. Rothemund, S. Roweis, and E. Winfree Massively
parallel DNA computation: Expansion of symbolic determinants by T. H. Leete,
M. D. Schwartz, R. M. Williams, D. H. Wood, J. S. Salem, and H. Rubin
Universal DNA computing models based on the splicing operation by G. Paun
Running dynamic programming algorithms on a DNA computer by E. B. Baum and D.
Boneh A molecular computation of the road coloring problem by N. Jonoska and
S. A. Karl DNA based molecular computation: Template-template interactions in
PCR by P. D. Kaplan, G. Cecchi, and A. Libchaber Use of a horizontal chain
reaction for DNA-based addition by F. Guarnieri and C. Bancroft Computation
with DNA: Matrix multiplication by J. S. Oliver A surface-based approach to
DNA computation by Q. Liu, Z. Guo, Z. Fei, A. E. Condon, R. M. Com, M. G.
Lagally, and L. M. Smith Mesoscopic computer engineering: Automating
DNA-based molecular computing via traditional practices of parallel computer
architecture design by J.-T. Amenyo Error-resistant implementation of DNA
computations by M. Amos, A. Gibbons, and D. Hodgson Making DNA computers
error resistant by D. Boneh, C. Dunworth, R. J. Lipton, and J. Sgall Active
transport in biological computing by S. A. Kurtz, S. R. Mahaney, J. S. Royer,
and J. Simon RNA based computing: Some examples from RNA catalysis and RNA
editing by L. F. Landweber Universal computation via self-assembly of DNA:
Some theory and experiments by E. Winfree, X. Yang, and N. C. Seeman The
perils of polynucleotides: The experimental gap between the design and
assembly of unusual DNA structures by N. C. Seeman, H. Wang, B. Liu, J. Qi,
X. Li, X. Yang, F. Liu, W. Sun, Z. Shen, R. Sha, C. Mao, Y. Wang, S. Zhang,
T.-J. Fu, S. Du, J. E. Mueller, Y. Zhang, and J. Chen DNA sequences useful
for computation by E. B. Baum A restricted genetic alphabet for DNA computing
by K. U. Mir Good encodings for DNA-based solutions to combinatorial problems
by R. Deaton, R. C. Murphy, M. Garzon, D. R. Franceschetti, and S. E.
Stevens, Jr. DNA computations can have global memory by R. J. Lipton Exascale
computer algebra problems interconnect with molecular reactions and
complexity theory by R. M. Williams and D. H. Wood.