On the computational power of insertion-deletion systems

Akihiro Takahara, Takashi Yokomori

研究成果: Article

16 引用 (Scopus)

抜粋

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.

元の言語English
ページ(範囲)269-280
ページ数12
ジャーナルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2568
出版物ステータスPublished - 2003 12 1

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント On the computational power of insertion-deletion systems' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用