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 publicationDNA Computing - 11th International Workshop on DNA Computing, DNA11, Revised Selected Papers
Pages224-235
Number of pages12
DOIs
Publication statusPublished - 2006 Jul 13
Event11th International Workshop on DNA Computing, DNA11 - London, ON, Canada
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)0302-9743
ISSN (Electronic)1611-3349

Conference

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Linearizer and doubler: Two mappings to unify molecular computing models based on DNA complementarity'. Together they form a unique fingerprint.

Cite this