Linearizer and doubler

Two mappings to unify molecular computing models based on DNA complementarity

Kaoru Onodera, Takashi Yokomori

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Citations (Scopus)

    Abstract

    Two specific mappings called doubler fd and linearizer f l are introduced to bridge two domains of languages. That is, f d maps string languages into (double-stranded) molecular languages, while fl transforms in the other way around. Using these mappings, we give new characterizations for the families of sticker languages and of Watson-Crick languages, which leads to not only a unified view of the two families of languages but also a clarified view of the computational capability of the DNA complementarity. One of the results implies that any recursively enumerable language can be expressed as the projective image of fd(L) for a minimal linear language L.

    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Pages224-235
    Number of pages12
    Volume3892 LNCS
    DOIs
    Publication statusPublished - 2006
    Event11th International Workshop on DNA Computing, DNA11 - London, ON
    Duration: 2005 Jun 62005 Jun 9

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume3892 LNCS
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other11th International Workshop on DNA Computing, DNA11
    CityLondon, ON
    Period05/6/605/6/9

    Fingerprint

    Molecular Computing
    Molecular Models
    Complementarity
    DNA
    Language
    Model-based
    Recursively Enumerable Languages
    Strings
    Transform
    Imply

    ASJC Scopus subject areas

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

    Cite this

    Onodera, K., & Yokomori, T. (2006). Linearizer and doubler: Two mappings to unify molecular computing models based on DNA complementarity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3892 LNCS, pp. 224-235). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3892 LNCS). https://doi.org/10.1007/11753681_18

    Linearizer and doubler : Two mappings to unify molecular computing models based on DNA complementarity. / Onodera, Kaoru; Yokomori, Takashi.

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3892 LNCS 2006. p. 224-235 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3892 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Onodera, K & Yokomori, T 2006, Linearizer and doubler: Two mappings to unify molecular computing models based on DNA complementarity. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 3892 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3892 LNCS, pp. 224-235, 11th International Workshop on DNA Computing, DNA11, London, ON, 05/6/6. https://doi.org/10.1007/11753681_18
    Onodera K, Yokomori T. Linearizer and doubler: Two mappings to unify molecular computing models based on DNA complementarity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3892 LNCS. 2006. p. 224-235. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11753681_18
    Onodera, Kaoru ; Yokomori, Takashi. / Linearizer and doubler : Two mappings to unify molecular computing models based on DNA complementarity. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3892 LNCS 2006. pp. 224-235 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{2fb920e7867e494085a86527ddb13fc4,
    title = "Linearizer and doubler: Two mappings to unify molecular computing models based on DNA complementarity",
    abstract = "Two specific mappings called doubler fd and linearizer f l are introduced to bridge two domains of languages. That is, f d maps string languages into (double-stranded) molecular languages, while fl transforms in the other way around. Using these mappings, we give new characterizations for the families of sticker languages and of Watson-Crick languages, which leads to not only a unified view of the two families of languages but also a clarified view of the computational capability of the DNA complementarity. One of the results implies that any recursively enumerable language can be expressed as the projective image of fd(L) for a minimal linear language L.",
    author = "Kaoru Onodera and Takashi Yokomori",
    year = "2006",
    doi = "10.1007/11753681_18",
    language = "English",
    isbn = "3540341617",
    volume = "3892 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    pages = "224--235",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

    }

    TY - GEN

    T1 - Linearizer and doubler

    T2 - Two mappings to unify molecular computing models based on DNA complementarity

    AU - Onodera, Kaoru

    AU - Yokomori, Takashi

    PY - 2006

    Y1 - 2006

    N2 - Two specific mappings called doubler fd and linearizer f l are introduced to bridge two domains of languages. That is, f d maps string languages into (double-stranded) molecular languages, while fl transforms in the other way around. Using these mappings, we give new characterizations for the families of sticker languages and of Watson-Crick languages, which leads to not only a unified view of the two families of languages but also a clarified view of the computational capability of the DNA complementarity. One of the results implies that any recursively enumerable language can be expressed as the projective image of fd(L) for a minimal linear language L.

    AB - Two specific mappings called doubler fd and linearizer f l are introduced to bridge two domains of languages. That is, f d maps string languages into (double-stranded) molecular languages, while fl transforms in the other way around. Using these mappings, we give new characterizations for the families of sticker languages and of Watson-Crick languages, which leads to not only a unified view of the two families of languages but also a clarified view of the computational capability of the DNA complementarity. One of the results implies that any recursively enumerable language can be expressed as the projective image of fd(L) for a minimal linear language L.

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

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

    U2 - 10.1007/11753681_18

    DO - 10.1007/11753681_18

    M3 - Conference contribution

    SN - 3540341617

    SN - 9783540341611

    VL - 3892 LNCS

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 224

    EP - 235

    BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    ER -