DAN-based string rewrite computational systems
نویسنده
چکیده
We describe a DNA computing system called programmed mutagenesis. prove that it is universal, and present experimental results from a prototype computation. DNA is a material with important characteristics, such as possessing all the information necessary for self-reproduction in the presence of appropriate enzymes and components, simple natural evolution mechanism, and miniature scale, all of which make it an attractive substrate for computation. For computer science, using single DNA molecules to represent the state of a computation holds the promise of a new paradigm of composable molecular computing. For biology, the demonstration that DNA sequences could guide their own evolution under computational rules may have implications as we begin to unravel the mysteries of genome encoding. Programmed mutagenesis is a DNA computing system that uses cycles of DNA annealing, ligation, and polymerization to implement programmatic rewriting of DNA sequences. We report that programmed mutagenesis is theoretically universal by showing how Minsky's 4-symbol 7-state Universal Turing Machine can be implemented using a programmed mutagenesis system. Each step of the Universal Turing Machine is implemented by four cycles of programmed mutagenesis, and progress is guaranteed by the use of alternate sense strands for each rewriting cycle. We constructed a unary counter, an example programmed mutagenesis system, and operated it through three cycles of mutagenesis to gather efficiency data. We showed that the counter operates with increasing efficiency, but decreasing overall yield. The measured efficiency of an in vitro programmed mutagenesis system suggests that the segregation of the products of DNA replication into separate compartments would be an efficient way to implement molecular computation. Naturally occurring phenomena such as gene conversion events and RNA editing processes are also discussed as possible manifestations of programmed mutagenesis-like systems. Thesis Supervisor: Professor David K. Gifford Title: Professor of Electrical Engineering and Computer Science
منابع مشابه
A Complex Example of a Simplifying Rewrite System
For a string rewriting system, it is known that termination by a simpliication ordering implies multiple recursive complexity. This theoretical upper bound is, however, far from having been reached by known examples of rewrite systems. All known methods used to establish termination by simpliication yield a primitive recursive bound. Furthermore, the study of the order types of simpliication or...
متن کاملPattern Graph Rewrite Systems
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric representations of string diagrams, amenable to automated reasoning about diagrammatic theories via graph rewrite systems. In this extended abstract, we show how the po...
متن کاملInfinite Families of Finite String Rewriting Systems and Their Confluence
We introduce parameterized rewrite systems for describing infinite families of finite string rewrite systems depending upon non-negative integer parameters, as well as ways to reason uniformly over these families. Unlike previous work, the vocabulary on which a rewrite system in the family is built depends itself on the integer parameters. Rewriting makes use of a toolkit for parameterized word...
متن کاملProving Termination of Rewrite Systems Using Bounds
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. We extend their work to non-left-linear rewrite systems. The key to this extension is the introduction of so-called raise rules and the use of tree automata that are not quite deterministic. Furthermore, we present ne...
متن کاملand L . Fribourg A Generic Rewrite Method for Proving Self − Stabilization Research
Self-stabilization is a property of distributed systems. It guarantees that, whatever the initial state, the system always reaches a stable set of states, called \legitimate conngurations", within a nite number of steps. The proof of convergence is generally done by exhibiting a measure that strictly decreases until a legitimate connguration is reached. The discovery of such a measure is very s...
متن کاملDeciding Termination for Ancestor Match- Bounded String Rewriting Systems
Termination of a string rewriting system can be characterized by termination on suitable recursively defined languages. This kind of termination criteria has been criticized for its lack of automation. In an earlier paper we have shown how to construct an automated termination criterion if the recursion is aligned with the rewrite relation. We have demonstrated the technique with Dershowitz’s f...
متن کامل