Abstract
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 INS 1 1 DEL 1 1 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
L. Kari and G. Thierrin: Contextual insertion/deletion and computability, Information and Computation, 131, 1 (1996), 47–61.
L. Kari, Gh. Paun, G. Thierrin, S. Yu: At the crossroads of DNA computing and formal languages: Characterizing RE using insertion-deletion systems, Proc. of 3rd DIMACS Workshop on DNA Based Computing, Philadelphia, (1997), 318–333.
Gh. Paun, G. Rozenberg and A. Salomaa: DNA Computing, Springer-Verlag, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Takahara, A., Yokomori, T. (2003). On the Computational Power of Insertion-Deletion Systems. In: Hagiya, M., Ohuchi, A. (eds) DNA Computing. DNA 2002. Lecture Notes in Computer Science, vol 2568. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36440-4_24
Download citation
DOI: https://doi.org/10.1007/3-540-36440-4_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00531-5
Online ISBN: 978-3-540-36440-5
eBook Packages: Springer Book Archive