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

Kaoru Onodera; Takashi Yokomori

doi:10.1007/11753681_18

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 f_d 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 f_l 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 f_d(L) for a minimal linear language L.

本文言語	English
ホスト出版物のタイトル	DNA Computing - 11th International Workshop on DNA Computing, DNA11, Revised Selected Papers
ページ	224-235
ページ数	12
DOI	https://doi.org/10.1007/11753681_18
出版ステータス	Published - 2006 7月 13
イベント	11th International Workshop on DNA Computing, DNA11 - London, ON, Canada 継続期間: 2005 6月 6 → 2005 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

Conference	11th International Workshop on DNA Computing, DNA11
国/地域	Canada
City	London, ON
Period	05/6/6 → 05/6/9

ASJC Scopus subject areas

理論的コンピュータサイエンス
コンピュータサイエンス（全般）

文献へのアクセス

10.1007/11753681_18

他のファイルとリンク

引用スタイル

Onodera, K., & Yokomori, T. (2006). Linearizer and doubler: Two mappings to unify molecular computing models based on DNA complementarity. In 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); 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.
DNA Computing - 11th International Workshop on DNA Computing, DNA11, Revised Selected Papers. 2006. p. 224-235 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3892 LNCS).

研究成果: Conference contribution

Onodera, K & Yokomori, T 2006, Linearizer and doubler: Two mappings to unify molecular computing models based on DNA complementarity. in DNA Computing - 11th International Workshop on DNA Computing, DNA11, Revised Selected Papers. 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, Canada, 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 DNA Computing - 11th International Workshop on DNA Computing, DNA11, Revised Selected Papers. 2006. p. 224-235. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11753681_18

Onodera, Kaoru ; Yokomori, Takashi. / 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. 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",

month = jul,

day = "13",

doi = "10.1007/11753681_18",

language = "English",

isbn = "3540341617",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "224--235",

booktitle = "DNA Computing - 11th International Workshop on DNA Computing, DNA11, Revised Selected Papers",

note = "11th International Workshop on DNA Computing, DNA11 ; Conference date: 06-06-2005 Through 09-06-2005",

}

TY - GEN

T1 - Linearizer and doubler

T2 - 11th International Workshop on DNA Computing, DNA11

AU - Onodera, Kaoru

AU - Yokomori, Takashi

PY - 2006/7/13

Y1 - 2006/7/13

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

AN - SCOPUS:33745764289

SN - 3540341617

SN - 9783540341611

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

SP - 224

EP - 235

BT - DNA Computing - 11th International Workshop on DNA Computing, DNA11, Revised Selected Papers

Y2 - 6 June 2005 through 9 June 2005

ER -

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

抄録

出版物シリーズ

Conference

ASJC Scopus subject areas

文献へのアクセス

他のファイルとリンク

フィンガープリント

引用スタイル