On the computational power of insertion-deletion systems

Akihiro Takahara, Takashi Yokomori

    Research output: Contribution to journalArticle

    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

    Fingerprint

    RNA Editing
    Molecular biology
    Insertional Mutagenesis
    Gene Deletion
    RNA
    Deletion
    Insertion
    Molecular Biology
    DNA
    Language
    Genes
    Processing
    Recursively Enumerable Languages
    Open Problems
    Gene
    Power (Psychology)
    Family

    ASJC Scopus subject areas

    • Computer Science(all)
    • Biochemistry, Genetics and Molecular Biology(all)
    • Theoretical Computer Science

    Cite this

    @article{bfe04affd57d412fabbf5e9fbde4096e,
    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 ([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.",
    author = "Akihiro Takahara and Takashi Yokomori",
    year = "2003",
    language = "English",
    volume = "2568",
    pages = "269--280",
    journal = "Lecture Notes in Computer Science",
    issn = "0302-9743",
    publisher = "Springer Verlag",

    }

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

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

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

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

    M3 - Article

    AN - SCOPUS:26044467466

    VL - 2568

    SP - 269

    EP - 280

    JO - Lecture Notes in Computer Science

    JF - Lecture Notes in Computer Science

    SN - 0302-9743

    ER -