Two complementary operations inspired by the DNA hairpin formation: Completion and reduction

Florin Manea, Victor Mitrana, Takashi Yokomori

    Research output: Contribution to journalArticle

    25 Citations (Scopus)

    Abstract

    We consider two complementary operations: Hairpin completion introduced in [D. Cheptea, C. Martin-Vide, V. Mitrana, A new operation on words suggested by DNA biochemistry: Hairpin completion, in: Proc. Transgressive Computing, 2006, pp. 216-228] with motivations coming from DNA biochemistry and hairpin reduction as the inverse operation of the hairpin completion. Both operations are viewed here as formal operations on words and languages. We settle the closure properties of the classes of regular and linear context-free languages under hairpin completion in comparison with hairpin reduction. While the class of linear context-free languages is exactly the weak-code image of the class of the hairpin completion of regular languages, rather surprisingly, the weak-code image of the class of the hairpin completion of linear context-free languages is a class of mildly context-sensitive languages. The closure properties with respect to the hairpin reduction of some time and space complexity classes are also studied. We show that the factors found in the general cases are not necessary for regular and context-free languages. This part of the paper completes the results given in the earlier paper, where a similar investigation was made for hairpin completion. Finally, we briefly discuss the iterated variants of these operations.

    Original languageEnglish
    Pages (from-to)417-425
    Number of pages9
    JournalTheoretical Computer Science
    Volume410
    Issue number4-5
    DOIs
    Publication statusPublished - 2009 Feb 17

    Fingerprint

    Context free languages
    Completion
    DNA
    Context-free Languages
    Biochemistry
    Context sensitive languages
    Closure Properties
    Formal languages
    Complexity Classes
    Regular Languages
    Space Complexity
    Time Complexity
    Class
    Necessary
    Computing

    Keywords

    • DNA computing
    • Hairpin completion
    • Hairpin reduction
    • Mildly context-sensitive languages

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Two complementary operations inspired by the DNA hairpin formation : Completion and reduction. / Manea, Florin; Mitrana, Victor; Yokomori, Takashi.

    In: Theoretical Computer Science, Vol. 410, No. 4-5, 17.02.2009, p. 417-425.

    Research output: Contribution to journalArticle

    @article{b5b89171e9af43dfab1201e3c79c4ba7,
    title = "Two complementary operations inspired by the DNA hairpin formation: Completion and reduction",
    abstract = "We consider two complementary operations: Hairpin completion introduced in [D. Cheptea, C. Martin-Vide, V. Mitrana, A new operation on words suggested by DNA biochemistry: Hairpin completion, in: Proc. Transgressive Computing, 2006, pp. 216-228] with motivations coming from DNA biochemistry and hairpin reduction as the inverse operation of the hairpin completion. Both operations are viewed here as formal operations on words and languages. We settle the closure properties of the classes of regular and linear context-free languages under hairpin completion in comparison with hairpin reduction. While the class of linear context-free languages is exactly the weak-code image of the class of the hairpin completion of regular languages, rather surprisingly, the weak-code image of the class of the hairpin completion of linear context-free languages is a class of mildly context-sensitive languages. The closure properties with respect to the hairpin reduction of some time and space complexity classes are also studied. We show that the factors found in the general cases are not necessary for regular and context-free languages. This part of the paper completes the results given in the earlier paper, where a similar investigation was made for hairpin completion. Finally, we briefly discuss the iterated variants of these operations.",
    keywords = "DNA computing, Hairpin completion, Hairpin reduction, Mildly context-sensitive languages",
    author = "Florin Manea and Victor Mitrana and Takashi Yokomori",
    year = "2009",
    month = "2",
    day = "17",
    doi = "10.1016/j.tcs.2008.09.049",
    language = "English",
    volume = "410",
    pages = "417--425",
    journal = "Theoretical Computer Science",
    issn = "0304-3975",
    publisher = "Elsevier",
    number = "4-5",

    }

    TY - JOUR

    T1 - Two complementary operations inspired by the DNA hairpin formation

    T2 - Completion and reduction

    AU - Manea, Florin

    AU - Mitrana, Victor

    AU - Yokomori, Takashi

    PY - 2009/2/17

    Y1 - 2009/2/17

    N2 - We consider two complementary operations: Hairpin completion introduced in [D. Cheptea, C. Martin-Vide, V. Mitrana, A new operation on words suggested by DNA biochemistry: Hairpin completion, in: Proc. Transgressive Computing, 2006, pp. 216-228] with motivations coming from DNA biochemistry and hairpin reduction as the inverse operation of the hairpin completion. Both operations are viewed here as formal operations on words and languages. We settle the closure properties of the classes of regular and linear context-free languages under hairpin completion in comparison with hairpin reduction. While the class of linear context-free languages is exactly the weak-code image of the class of the hairpin completion of regular languages, rather surprisingly, the weak-code image of the class of the hairpin completion of linear context-free languages is a class of mildly context-sensitive languages. The closure properties with respect to the hairpin reduction of some time and space complexity classes are also studied. We show that the factors found in the general cases are not necessary for regular and context-free languages. This part of the paper completes the results given in the earlier paper, where a similar investigation was made for hairpin completion. Finally, we briefly discuss the iterated variants of these operations.

    AB - We consider two complementary operations: Hairpin completion introduced in [D. Cheptea, C. Martin-Vide, V. Mitrana, A new operation on words suggested by DNA biochemistry: Hairpin completion, in: Proc. Transgressive Computing, 2006, pp. 216-228] with motivations coming from DNA biochemistry and hairpin reduction as the inverse operation of the hairpin completion. Both operations are viewed here as formal operations on words and languages. We settle the closure properties of the classes of regular and linear context-free languages under hairpin completion in comparison with hairpin reduction. While the class of linear context-free languages is exactly the weak-code image of the class of the hairpin completion of regular languages, rather surprisingly, the weak-code image of the class of the hairpin completion of linear context-free languages is a class of mildly context-sensitive languages. The closure properties with respect to the hairpin reduction of some time and space complexity classes are also studied. We show that the factors found in the general cases are not necessary for regular and context-free languages. This part of the paper completes the results given in the earlier paper, where a similar investigation was made for hairpin completion. Finally, we briefly discuss the iterated variants of these operations.

    KW - DNA computing

    KW - Hairpin completion

    KW - Hairpin reduction

    KW - Mildly context-sensitive languages

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

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

    U2 - 10.1016/j.tcs.2008.09.049

    DO - 10.1016/j.tcs.2008.09.049

    M3 - Article

    AN - SCOPUS:58249132291

    VL - 410

    SP - 417

    EP - 425

    JO - Theoretical Computer Science

    JF - Theoretical Computer Science

    SN - 0304-3975

    IS - 4-5

    ER -