On the computational power of DNA
Discrete Applied Mathematics - Special volume on computational molecular biology
Contextual insertions/deletions and computability
Information and Computation
Journal of Computer and System Sciences
Programmed Mutagenesis Is a Universal Model of Computation
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
| Hi-index | 0.00 |
Mismatched DNA annealing followed by strand replication can cause the programmed evolution of DNA sequences. We have reported that this process is theoretically equivalent in computational power to a desktop computer by demonstrating a constructive way to encode arbitrary computations as DNA molecules within the framework of programmed mutagenesis, a system that consists solely of cycles of DNA annealing, polymerization, and ligation.) Thus, programmed mutagenesis is theoretically universal and we report here the experimental efficiency of its primitive operations. The measured efficiency of an in vitro programmed mutagenesis system suggests that segregating the products of DNA replication into separate compartments would be an efficient way to implement molecular 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 and natural evolution.