Abstract
From a biological motivation of interactions between linear and circular DNA sequences, we propose a new type of splicing models called circular H systems and show that they have the same computational power as Turing machines. It is also shown that there effectively exists a universal circular H system which can simulate any circular H system with the same terminal alphabet, which strongly suggests a feasible design for a DNA computer based on circular splicing.
| Original language | English |
|---|---|
| Pages | 219-224 |
| Number of pages | 6 |
| Publication status | Published - 1997 Jan 1 |
| Externally published | Yes |
| Event | Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, ICEC'97 - Indianapolis, IN, USA Duration: 1997 Apr 13 → 1997 Apr 16 |
Other
| Other | Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, ICEC'97 |
|---|---|
| City | Indianapolis, IN, USA |
| Period | 97/4/13 → 97/4/16 |
ASJC Scopus subject areas
- Computer Science(all)
- Engineering(all)