On the computational power of insertion-deletion systems

Akihiro Takahara, Takashi Yokomori

Research output: Contribution to journalArticlepeer-review

16 Citations (Scopus)

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 1DEL 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.

Original languageEnglish
Pages (from-to)269-280
Number of pages12
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2568
Publication statusPublished - 2003 Dec 1

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On the computational power of insertion-deletion systems'. Together they form a unique fingerprint.

Cite this