Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/3-540-46691-6_21 | FSTTCS |
Keywords | Field | DocType |
turing machine,vivo byp,dna computing,dna computing research,deletion type,dna computation,universal computational power,computational power,deletion system,circular insertion,homologous recombination | Formal language,Evolutionary algorithm,Computer science,Algorithm,DNA,Turing machine,Rewriting,Genetic algorithm,DNA computing,Computation | Conference |
ISBN | Citations | PageRank |
3-540-66836-5 | 0 | 0.34 |
References | Authors | |
6 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lila Kari | 1 | 1123 | 124.45 |
| Mark Daley | 2 | 166 | 22.18 |
| Greg Gloor | 3 | 37 | 4.90 |
| Rani Siromoney | 4 | 459 | 76.25 |
| Laura F Landweber | 5 | 206 | 28.80 |