On the Computational Power of DNA Annealing and Ligation (1995)
| Venue: | DNA Based Computers, volume 27 of DIMACS |
| Citations: | 62 - 18 self |
BibTeX
@INPROCEEDINGS{Winfree95onthe,
author = {Erik Winfree},
title = {On the Computational Power of DNA Annealing and Ligation},
booktitle = {DNA Based Computers, volume 27 of DIMACS},
year = {1995},
pages = {pages},
publisher = {American Mathematical Society}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In [Winfree] it was shown that the DNA primitives of Separate, Merge, and Amplify were not sufficiently powerful to invert functions defined by circuits in linear time. Dan Boneh et al [Boneh] show that the addition of a ligation primitive, Append, provides the missing power. The question becomes, "How powerful is ligation? Are Separate, Merge, and Amplify necessary at all?" This paper proposes to informally explore the power of annealing and ligation for DNA computation. We conclude, in fact, that annealing and ligation alone are theoretically capable of universal computation. 1 Introduction When Len Adleman introduced the paradigm of using DNA to solve combinatorial problems [Adleman], his computational scheme involved two distinct phases. To solve the directed Hamiltonian path problem, he first mixed together in a test tube a carefully designed set of DNA oligonucleotide "building blocks", which anneal to each other and are ligated to create long strands of DNA representing paths t...
