Formal languages
Contextual insertions/deletions and computability
Information and Computation
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination
Handbook of formal languages, vol. 2
Automata, Languages, and Machines
Automata, Languages, and Machines
Handbook of Formal Languages
Circular DNA and Splicing Systems
ICPIA '92 Proceedings of the Second International Conference on Parallel Image Analysis
From Micro-Soft to Bio-Soft: Computing With DNA
Biocomputing and emergent computation: Proceedings of BCEC97
Circular Contextual Insertions/Deletions with Applications to Biomolecular Computation
SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
Linear and circular splicing systems
INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)
| Hi-index | 0.00 |
This paper addresses two main aspects of DNA computing research: DNA computing in vitro and in vivo. We first present a model of DNA computation developed in [5]: the circular insertion/deletion system. We review the result obtained in [5] stating that this system has the computational power of a Turing machine, and present the outcome of a molecular biologylab oratoryex periment from [5] that implements a small instance of such a system. This shows that rewriting systems of the circular insertion/deletion type are viable alternatives in DNA computation in vitro. In the second half of the paper we address DNA computing in vivo byp resenting a model proposed in [17] and developed in [18] for the homologous recombinations that take place during gene rearrangement in ciliates. Such a model has universal computational power which indicates that, in principle, some unicellular organisms mayha ve the capacity to perform anycom putation carried out byan electronic computer.