Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Context-free insertion-deletion systems
Theoretical Computer Science - Descriptional complexity of formal systems
Note: On the weight of universal insertion grammars
Theoretical Computer Science
DNA algorithms for fractal construction-an application of the SInsDelP system
International Journal of Computer Mathematics
Further Results on Insertion-Deletion Systems with One-Sided Contexts
Language and Automata Theory and Applications
On minimal context-free insertion-deletion systems
Journal of Automata, Languages and Combinatorics
Insertion-deletion systems with one-sided contexts
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
P systems with minimal insertion and deletion
Theoretical Computer Science
Computational power of insertion---deletion (P) systems with rules of size two
Natural Computing: an international journal
Circular post machines and p systems with exo-insertion and deletion
CMC'11 Proceedings of the 12th international conference on Membrane Computing
P Systems with Insertion and Deletion Exo-Operations
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Matrix insertion-deletion systems
Theoretical Computer Science
| Hi-index | 0.00 |
Insertions and deletions of small circular DNA strands into long linear DNA strands are phenomena that happen frequently in nature and thus constitute an attractive paradigm for biomolecular computing. This paper presents a new model for DNA-based computation that involves circula r as well as linear molecules, and that uses the operations of insertion and deletion. After intro ducing the formal model we investigate its properties and prove in particular that the circular insertion/deletion systems are capable of universal computation. We also give the results of an experimental laboratory implementation of our model. This shows that rewriting systems of the circular insertion/deletion type are viable alternatives in DNA computation.