On the Computational Power of DNA Annealing and Ligation

In [20] 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 [4] 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

Design and implementation of computational systems based on programmed mutagenesis

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.Includes bibliographical references (p. 35-37).by Julia Khodor.M.S

DNA computers in vitro and vivo

We show how DNA molecules and standard lab techniques may be used to create a nondeterministic Turing machine. This is the first scheme that shows how to make a universal computer with DNA. We claim that both our scheme and previous ones will work, but they probably cannot be scaled up to be of practical computational importance. In vivo, many of the limitations on our and previous computers are much less severe or do not apply. Hence, lifeforms ought, at least in principle, to be capable of large Turing universal computations. The second part of our paper is a loose collection of biological phenomena that look computational and mathematical models of computation that look biological. We observe that cells face some daunting computational problems, e.g. gene regulation, assembly of complex structures, and antibody synthesis. We then make simplified mathematical models of certain biochemical processes and investigate the computational power of these models. The view of "biology as a com..