Abstract
The idea that living cells and molecular complexes can be viewed as potential machinic components dates back to the late 1950s, when Richard Feynman delivered his famous paper describing sub-microscopic computers. Recently, several papers have advocated the realisation of massively parallel computation using the techniques and chemistry of molecular biology. Algorithms are not executed on a traditional, siliconbased computer, but instead employ the test-tube technology of genetic engineering. By representing information as sequences of bases in DNA molecules, existing DNA-manipulation techniques may be used to quickly detect and amplify desirable solutions to a given problem.
We review the recent spate of papers in this field and take a critical view of their implications for laboratory experimentation. We note that extant models of DNA computation are flawed in that they rely upon certain error-prone biological operations. The one laboratory experiment that is seminal for current interest and claims to provide an efficient solution for the Hamiltonian path problem has proved to be unrepeatable by other researchers. We introduce a new model of DNA computation whose implementation is likely to be far more error-resistant than extant proposals. We describe an abstraction of the model which lends itself to natural algorithmic description, particularly for problems in the complexity class NP. In addition we describe a number of linear-time parallel algorithms within our model, particularly for NP-complete problems. We describe an “in vitro” realisation of the model and conclude with a discussion of future work and outstanding problems.
Preview
Unable to display preview. Download preview PDF.
References
Leonard Adleman. Molecular computation of solutions to combinatorial problems. Science, 266:1021–1024, 1994.
Martyn Amos, Alan Gibbons, and David Hodgson. Error-resistant implementation of DNA computations. Research Report CS-RR-298, Department of Computer Science, University of Warwick, Coventry, UK, January 1996.
Eric Bach, Anne Condon, Elton Glaser, and Celena Tanguay. DNA models and algorithms for NP-complete problems. Submitted, March 1996.
Eric B. Baum and Dan Boneh. Running dynamic programming algorithms on a DNA computer. Unpublished manuscript, February 1996.
C. H. Bennett. The thermodynamics of computation — a review. International Journal of Theoretical Physics, 21:905–940, 1982.
New England Biolabs. Catalog, 1996.
T.A. Brown. Genetics: A molecular approach. Chapman and Hall, 1993.
James D. Watson et. al. Recombinant DNA. Scientific American Books, 1992.
Richard P. Feynman. There's plenty of room at the bottom. In D. Gilbert, editor, Miniaturization, pages 282–296. Reinhold, 1961.
Rudolf Freund, Lila Kari, and Gheorghe Paun. DNA computation based on splicing: The existence of universal computers. Submitted.
Michael R. Garey and David S. Johnson. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
A. M. Gibbons. Algorithmic Graph Theory. Cambridge University Press, 1985.
David K. Gifford. On the path to computation with DNA. Science, 266:993–994, 1994.
Juris Hartmanis. On the weight of computations. Bulletin of the European Association For Theoretical Computer Science, 55:136–138, 1995.
Tom Head. Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bulletin of Mathematical Biology, 49:737–759, 1987.
Peter Kaplan, Guillermo Cecchi, and Albert Libchaber. Molecular computation: Adleman's experiment repeated. Technical report, NEC Research Institute, 1995.
Richard M. Karp, Claire Kenyon, and Orli Waarts. Error-resilient DNA computation. In 7th ACM-SIAM Symposium on Discrete Algorithms, pages 458–467. SIAM, 1996.
Richard J. Lipton. DNA solution of hard computational problems. Science, 268:542–545, 1995.
Kary B. Mullis. The unusual origin of the polymerase chain reaction. Scientific American, 262:36–43, 1990.
Kary B. Mullis, François Ferré, and Richard A. Gibbs, editors. The polymerase chain reaction. Birkhauser, 1994.
Robert Pool. A boom in plans for DNA computing. Science. 268:498–499, 1995.
John H. Reif. Parallel molecular computation: Models and simulations. In Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Santa Barbara, June 1995.
Paul W. K. Rothemund. A DNA and restriction enzyme implementation of Turing Machines. Unpublished manuscript, 1995.
J. Williams, A. Ceccarelli, and N. Spurr. Genetic Engineering. βios Scientific Publishers, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gibbons, A., Amos, M., Hodgson, D. (1996). Models of DNA computation. In: Penczek, W., Szałas, A. (eds) Mathematical Foundations of Computer Science 1996. MFCS 1996. Lecture Notes in Computer Science, vol 1113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61550-4_138
Download citation
DOI: https://doi.org/10.1007/3-540-61550-4_138
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61550-7
Online ISBN: 978-3-540-70597-0
eBook Packages: Springer Book Archive