Molecular Computation by DNA Hairpin Formation
Top Cited Papers
- 19 May 2000
- journal article
- other
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 288 (5469), 1223-1226
- https://doi.org/10.1126/science.288.5469.1223
Abstract
Hairpin formation by single-stranded DNA molecules was exploited in a DNA-based computation in order to explore the feasibility of autonomous molecular computing. An instance of the satisfiability problem, a famous hard combinatorial problem, was solved by using molecular biology techniques. The satisfiability of a given Boolean formula was examined autonomously, on the basis of hairpin formation by the molecules that represent the formula. This computation algorithm can test several clauses in the given formula simultaneously, which could reduce the number of laboratory steps required for computation.Keywords
This publication has 20 references indexed in Scilit:
- Molecular computation: RNA solutions to chess problemsProceedings of the National Academy of Sciences of the United States of America, 2000
- Biomolecular computing and programmingIEEE Transactions on Evolutionary Computation, 1999
- Perspectives on molecular computingNew Generation Computing, 1999
- Demonstration of a word design strategy for DNA computing on surfacesNucleic Acids Research, 1997
- Making DNA AddScience, 1996
- DNA Solution of Hard Computational ProblemsScience, 1995
- Molecular Computation of Solutions to Combinatorial ProblemsScience, 1994
- Sequence specific generation of a DNA panhardle permits PCR amplication of unknown flanking DNANucleic Acids Research, 1992
- Predicting DNA duplex stability from the base sequence.Proceedings of the National Academy of Sciences of the United States of America, 1986
- The thermodynamics of computation—a reviewInternational Journal of Theoretical Physics, 1982