Linearizer and doubler: Two mappings to unify molecular computing models based on DNA complementarity

Kaoru Onodera, Takashi Yokomori

研究成果: Conference contribution

2 引用 (Scopus)

抜粋

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.

元の言語English
ホスト出版物のタイトルDNA Computing - 11th International Workshop on DNA Computing, DNA11, Revised Selected Papers
ページ224-235
ページ数12
DOI
出版物ステータスPublished - 2006 7 13
イベント11th International Workshop on DNA Computing, DNA11 - London, ON, Canada
継続期間: 2005 6 62005 6 9

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
3892 LNCS
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

Conference

Conference11th International Workshop on DNA Computing, DNA11
Canada
London, ON
期間05/6/605/6/9

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント Linearizer and doubler: Two mappings to unify molecular computing models based on DNA complementarity' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Onodera, K., & Yokomori, T. (2006). Linearizer and doubler: Two mappings to unify molecular computing models based on DNA complementarity. : DNA Computing - 11th International Workshop on DNA Computing, DNA11, Revised Selected Papers (pp. 224-235). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 3892 LNCS). https://doi.org/10.1007/11753681_18