On the computational power of insertion-deletion systems

Akihiro Takahara, Takashi Yokomori

    研究成果: Article

    22 引用 (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

      フィンガープリント

    ASJC Scopus subject areas

    • Computer Science(all)

    これを引用