Skip to main content
SpringerLink
Log in

An Analysis of Computational Efficiency of DNA Computing

  • Conference paper
  • First Online:
Unconventional Models of Computation (UMC 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2509))

Included in the following conference series:

  • 435 Accesses

Abstract

In this paper, we investigate the relation between an exper- imental condition and computational (reaction) efficiency of a simple model in DNA computing. A DNA computing algorithm needs many chemical and enzyme reactions in its solution process. An experimental condition for DNA computing is generally based on a molecular biology protocol. However, the purpose of an experiment is different in DNA computing and molecular biology. Therefore, we verified the relation bet- ween an experimental condition, reaction time, and reaction efficiency specifically from the viewpoint of DNA computing.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Adleman, “Molecular Computation of Solutions to Combinatorial Problems”, Science 266, pp. 1021–1024(1994).

    Article  Google Scholar 

  2. R. J. Lipton, “DNA Solution of Hard Computational Problems”, Science 268, pp. 542–545 (1995).

    Article  Google Scholar 

  3. Y. Aoi, T. Yoshinobu, K. Tanizawa, K. Kinoshita and H. Iwasaki, “Ligation Errors in DNA Computing”, BioSystems, Vol. 52,1–3, pp. 181–187 (1999).

    Article  Google Scholar 

  4. M. Yamamoto, J. Yamashita, T. Shiba, T. Hirayama, S. Takiya, K. Suzuki, M. Munekata and A. Ohuchi, “A Study on the Hybridization Process in DNA Computing”, DIM ACS Series in Discrete Mathematics and Theoretical Computer Science, 54, pp. 101–110, 2000.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Japan Science and Technology Cooperation (JST), Honmachi 4-1-8, Kawaguchi, 332-0012, Japan

    Atsushi Kameda

  2. PRESTO, Japan Science and Technology Cooperation (JST) and Graduate School of Engineering, Hokkaido University, North 13, West 8, Kita-ku, Sapporo, 060-8628, Japan

    Masahito Yamamoto

  3. Graduate School of Engineering, Hokkaido University, North 13, West 8, Kita-ku, Sapporo, 060-8628, Japan

    Nobuo Matsuura & Azuma Ohuchi

Authors
  1. Atsushi Kameda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nobuo Matsuura
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Masahito Yamamoto
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Azuma Ohuchi
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kameda, A., Matsuura, N., Yamamoto, M., Ohuchi, A. (2002). An Analysis of Computational Efficiency of DNA Computing. In: Unconventional Models of Computation. UMC 2002. Lecture Notes in Computer Science, vol 2509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45833-6_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-45833-6_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44311-7

  • Online ISBN: 978-3-540-45833-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation