Skip to main content

Hierarchical DNA Memory Based on Nested PCR

  • Conference paper
  • First Online:

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

Abstract

This paper presents a hierarchical DNA memory based on nested PCR. Each DNA strand in memory consists of address blocks and a data block. In order to access specific data, we specify the order of the address primers, and nested PCR are performed by using these primers. Our laboratory experiments are also presented to demonstrate the feasibility of the proposed memory.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Head, M. Yamamura, and S. Gal: “Aqueous Computing. writing on molecules”, Proceedings of CEC 99, (Congress on Evolutionary Computation), pp. 1006–1010 (1999)

    Google Scholar 

  2. T. Head, G. Rozenberg, R. S. Bradergroen, C. K. D. Breek, P. H. M. Lommerse and H. P. Spaink: “Computing with DNA by operating on plasmids”, Biosystems, Vol.57, pp. 875–882 (2000)

    Article  Google Scholar 

  3. E. B. Baum: “Building an Associative Memory Vastly Larger Than the Brain”, Science, Vol.268, pp. 583–585 (1995)

    Article  Google Scholar 

  4. J. H. Reif and T. H. LaBean: “Computationally Inspired Biotechnologies: Improved DNA Synthesis and Associative Search Using Error-Correcting Codes and Vector-Quantization”, Sixth International Meeting on DNA Based Computers (DNA6), in Lecture Notes in Computer Science, pp. 145–172 (2001)

    Google Scholar 

  5. J. H. Reif, T. H. LaBean and M. Pirrung: “Experimental Construction of Very Large Scale DNA Databases with Associative Search Capability”, Seventh International Meeting on DNA Based Computers (DNA7), in Lecture Notes in Computer Science, pp. 231–247 (2002)

    Google Scholar 

  6. M. Arita, A. Nishikawa, M. Hagiya, K. Komiya and H. Gouzu and K. Sakamoto: “Improving Sequence Design for DNA Computing”, Proceedings of GECCO’00 (Genetic and Evolutionary Computation Conference), pp. 875–882 (2000)

    Google Scholar 

  7. M. Garzon, R. Deaton, L. F. Nino and Ed Stevens: “Encoding Genomes for DNA Computing”, Proceedings of the Third Annual Genetic Programming Conference, pp. 684–690 (1998)

    Google Scholar 

  8. F. Tanaka, M. Nakatsugawa, M. Yamamoto, T. Shiba and A. Ohuchi: “Developing Support System for Sequence Design in DNA Computing”, Seventh International Meeting on DNA Based Computers (DNA7), in Lecture Notes in Computer Science, pp. 129–137 (2002)

    Google Scholar 

  9. M. J. McPherson, P. Quirke and G. R. Taylor: “PCR A Practical Approach”, IRL PRESS, (1991)

    Google Scholar 

  10. M. J. McPherson, B. D. Hames and G. R. Taylor: “PCR2 A Practical Approach”, IRL PRESS, (1995).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kashiwamura, S., Yamamoto, M., Kameda, A., Shiba, T., Ohuchi, A. (2003). Hierarchical DNA Memory Based on Nested PCR. In: Hagiya, M., Ohuchi, A. (eds) DNA Computing. DNA 2002. Lecture Notes in Computer Science, vol 2568. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36440-4_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-36440-4_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00531-5

  • Online ISBN: 978-3-540-36440-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics