Skip to main content
Springer Nature Link
Log in

Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity

  • Conference paper
DNA Computing (DNA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3892))

Included in the following conference series:

  • 792 Accesses

Abstract

Two specific mappings called doublerf d and linearizerf ℓ are introduced to bridge two domains of languages. That is, f d maps string languages into (double-stranded) molecular languages, while f ℓ 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Hoogeboom, H.J., Vugt, N.V.: Fair sticker languages. Acta Informatica 37, 213–225 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Păun, G.: Marcus contextual grammar. Kluwer Academic Publishers, Dordrecht (1997)

    Book  MATH  Google Scholar 

  3. Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing. New Computing Paradigms. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  4. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  5. Salomaa, A.: Turing, Watson-Crick and Lindenmayer: Aspects of DNA Complementarity. In: Unconventional Models of Computation, Auckland, pp. 94–107. Springer, Heidelberg (1998)

    Google Scholar 

  6. Sakakibara, Y., Kobayashi, S.: Sticker systems with complex structures. Soft Computing 5, 114–120 (2001)

    Article  MATH  Google Scholar 

  7. Vliet, R., van Hoogeboon, H.J., Rozenberg, G.: Combinatorial Aspects of Minimal DNA Expressions. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 84–96. Springer, Heidelberg (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Major, Graduate School of Education, Waseda University, 1-6-1 Nishiwaseda, Shinjyuku-ku, Tokyo, 169-8050, Japan

    Kaoru Onodera

  2. Department of Mathematics, Faculty of Education and Integrated Arts and Sciences, Waseda University, 1-6-1 Nishiwaseda, Shinjyuku-ku, Tokyo, 169-8050, Japan

    Takashi Yokomori

Authors
  1. Kaoru Onodera
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takashi Yokomori
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Université Pierre et Marie Curie, INSERM U511,, 91 Boulevard de L’Hôpital, 75013, Paris, France

    Alessandra Carbone

  2. California Institute of Technology, Applied and Computational Mathematics, Bioengineering,, MC 114-96, 91125, Pasadena, CA, USA

    Niles A. Pierce

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Onodera, K., Yokomori, T. (2006). Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity. In: Carbone, A., Pierce, N.A. (eds) DNA Computing. DNA 2005. Lecture Notes in Computer Science, vol 3892. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11753681_18

Download citation

  • DOI: https://doi.org/10.1007/11753681_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34161-1

  • Online ISBN: 978-3-540-34165-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics