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 (Kari and Thierrin, 1996; Kari et al., 1997).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 Kari et al. (1997) where it was conjectured contrary.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Kari L and Thierrin G (1996) Contextual insertion/deletion and computability. Information and Computation 131(1): 47–61
Kari L, Paun Gh, Thierrin G and Yu S (1997) 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, pp. 318–333
Paun Gh, Rozenberg G and Salomaa A (1998) DNA Computing. Springer-Verlag
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Takahara, A., Yokomori, T. On the computational power of insertion-deletion systems. Natural Computing 2, 321–336 (2003). https://doi.org/10.1023/B:NACO.0000006769.27984.23
Issue Date:
DOI: https://doi.org/10.1023/B:NACO.0000006769.27984.23