Contextual insertions/deletions and computability
Information and Computation
Molecular computing paradigm – toward freedom from Turing's charm
Natural Computing: an international journal
Journal of Computer Science and Technology - Special issue on bioinformatics
Context-free insertion-deletion systems
Theoretical Computer Science - Descriptional complexity of formal systems
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
| Hi-index | 0.00 |
Gene insertion and deletion are basic phenomena found in DNA processing or RNA editing in molecular biology. The genetic mechanism and development based on these evolutionary transformations have been formulated as a formal system with two operations of insertion and deletion, called insertion-deletion systems ([1], [2]).We investigate the generative power of insertion-deletion systems (InsDel systems), and show that the family INS11DEL11 is equal to the family of recursively enumerable languages. This gives a positive answer to an open problem posed in [2] where it was conjectured to be negative.