Hairpin languages

Gheorghe Pǎun, Grzegorz Rozenberg, Takashi Yokomori

    Research output: Contribution to journalArticle

    23 Citations (Scopus)

    Abstract

    Molecules with hairpin structure(s) form a natural extension of linear non-branched molecules, and they have been already used in experimental work in DNA computing. In this paper we introduce and investigate classes of string languages (hence languages modeling the sets of linear DNA molecules), consisting of strings which can (fold on itself and) form hairpins. We classify the complexity of these classes using language-theoretic techniques. We also discuss a further use of hairpin molecules in DNA computing.

    Original languageEnglish
    Pages (from-to)837-847
    Number of pages11
    JournalInternational Journal of Foundations of Computer Science
    Volume12
    Issue number6
    DOIs
    Publication statusPublished - 2001

    Fingerprint

    Molecules
    DNA

    ASJC Scopus subject areas

    • Computer Science (miscellaneous)

    Cite this

    Hairpin languages. / Pǎun, Gheorghe; Rozenberg, Grzegorz; Yokomori, Takashi.

    In: International Journal of Foundations of Computer Science, Vol. 12, No. 6, 2001, p. 837-847.

    Research output: Contribution to journalArticle

    Pǎun, Gheorghe ; Rozenberg, Grzegorz ; Yokomori, Takashi. / Hairpin languages. In: International Journal of Foundations of Computer Science. 2001 ; Vol. 12, No. 6. pp. 837-847.
    @article{16e712005880453a80af9ff922f3a946,
    title = "Hairpin languages",
    abstract = "Molecules with hairpin structure(s) form a natural extension of linear non-branched molecules, and they have been already used in experimental work in DNA computing. In this paper we introduce and investigate classes of string languages (hence languages modeling the sets of linear DNA molecules), consisting of strings which can (fold on itself and) form hairpins. We classify the complexity of these classes using language-theoretic techniques. We also discuss a further use of hairpin molecules in DNA computing.",
    author = "Gheorghe Pǎun and Grzegorz Rozenberg and Takashi Yokomori",
    year = "2001",
    doi = "10.1142/S0129054101000904",
    language = "English",
    volume = "12",
    pages = "837--847",
    journal = "International Journal of Foundations of Computer Science",
    issn = "0129-0541",
    publisher = "World Scientific Publishing Co. Pte Ltd",
    number = "6",

    }

    TY - JOUR

    T1 - Hairpin languages

    AU - Pǎun, Gheorghe

    AU - Rozenberg, Grzegorz

    AU - Yokomori, Takashi

    PY - 2001

    Y1 - 2001

    N2 - Molecules with hairpin structure(s) form a natural extension of linear non-branched molecules, and they have been already used in experimental work in DNA computing. In this paper we introduce and investigate classes of string languages (hence languages modeling the sets of linear DNA molecules), consisting of strings which can (fold on itself and) form hairpins. We classify the complexity of these classes using language-theoretic techniques. We also discuss a further use of hairpin molecules in DNA computing.

    AB - Molecules with hairpin structure(s) form a natural extension of linear non-branched molecules, and they have been already used in experimental work in DNA computing. In this paper we introduce and investigate classes of string languages (hence languages modeling the sets of linear DNA molecules), consisting of strings which can (fold on itself and) form hairpins. We classify the complexity of these classes using language-theoretic techniques. We also discuss a further use of hairpin molecules in DNA computing.

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

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

    U2 - 10.1142/S0129054101000904

    DO - 10.1142/S0129054101000904

    M3 - Article

    VL - 12

    SP - 837

    EP - 847

    JO - International Journal of Foundations of Computer Science

    JF - International Journal of Foundations of Computer Science

    SN - 0129-0541

    IS - 6

    ER -