On the computational power of insertion-deletion systems

Akihiro Takahara, Takashi Yokomori

    Research output: Contribution to journalArticle

    22 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 (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.

    Original languageEnglish
    Pages (from-to)321-336
    Number of pages16
    JournalNatural Computing
    Volume2
    Issue number4
    DOIs
    Publication statusPublished - 2003

    Fingerprint

    Molecular biology
    RNA
    DNA
    Genes
    Processing

    Keywords

    • Computational powers
    • DNA computing
    • Insertion-deletion systems

    ASJC Scopus subject areas

    • Computer Science(all)

    Cite this

    On the computational power of insertion-deletion systems. / Takahara, Akihiro; Yokomori, Takashi.

    In: Natural Computing, Vol. 2, No. 4, 2003, p. 321-336.

    Research output: Contribution to journalArticle

    Takahara, Akihiro ; Yokomori, Takashi. / On the computational power of insertion-deletion systems. In: Natural Computing. 2003 ; Vol. 2, No. 4. pp. 321-336.
    @article{494282734dc948f2b6f8da2b44044777,
    title = "On the computational power of insertion-deletion systems",
    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.",
    keywords = "Computational powers, DNA computing, Insertion-deletion systems",
    author = "Akihiro Takahara and Takashi Yokomori",
    year = "2003",
    doi = "10.1023/B:NACO.0000006769.27984.23",
    language = "English",
    volume = "2",
    pages = "321--336",
    journal = "Natural Computing",
    issn = "1567-7818",
    publisher = "Springer Netherlands",
    number = "4",

    }

    TY - JOUR

    T1 - On the computational power of insertion-deletion systems

    AU - Takahara, Akihiro

    AU - Yokomori, Takashi

    PY - 2003

    Y1 - 2003

    N2 - 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.

    AB - 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.

    KW - Computational powers

    KW - DNA computing

    KW - Insertion-deletion systems

    UR - http://www.scopus.com/inward/record.url?scp=4344668130&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=4344668130&partnerID=8YFLogxK

    U2 - 10.1023/B:NACO.0000006769.27984.23

    DO - 10.1023/B:NACO.0000006769.27984.23

    M3 - Article

    AN - SCOPUS:4344668130

    VL - 2

    SP - 321

    EP - 336

    JO - Natural Computing

    JF - Natural Computing

    SN - 1567-7818

    IS - 4

    ER -