On the computational power of insertion-deletion systems

Akihiro Takahara*, Takashi Yokomori

*この研究の対応する著者

研究成果: Article査読

35 被引用数 (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 (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.

本文言語English
ページ(範囲)321-336
ページ数16
ジャーナルNatural Computing
2
4
DOI
出版ステータスPublished - 2003 12月 1

ASJC Scopus subject areas

  • コンピュータ サイエンスの応用

フィンガープリント

「On the computational power of insertion-deletion systems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル