Skip to main content

Experimental Confirmation of the Basic Principles of Length-only Discrimination

  • Conference paper
  • First Online:
Book cover DNA Computing (DNA 2001)

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

Included in the following conference series:

Abstract

We previously introduced the length-only discrimination (LOD) method for generate and search models of DNA computing. Here we report experimental confirmation of the validity of the basic operations of LOD method. We created a test graph consisting of four nodes and three edges, in which multiple paths are possible. Experimental results indicate that primitive operations required to implement LOD method work efficiently. We conclude that further work is needed to test the efficiency and practicality of applying LOD methodology to larger graphs.

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

Access this chapter

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. Adleman, L. M.: Molecular computation of solutions to combinatorial problems. Science 266 (1994), 1021–1024.

    Article  Google Scholar 

  2. Guarnieri, F., Orlian, M., Bancroft, C.: Parallel operations in DNA-based computation. In: Rubin, H., Wood, D.H. (eds.): DNA based computers III: DIMACS Workshop, June 23–25, 1997, Providence, R.I.: American Mathematical Society (1999), 85–100.

    Google Scholar 

  3. Khodor, J., Gifford, D.K.: The efficiency of sequence-specific separation of DNA mixtures for biological computing. In: Rubin, H., Wood, D.H. (eds.): DNA based computers III: DIMACS Workshop, June 23–25, 1997, Providence, R.I.: American Mathematical Society (1999), 39–46.

    Google Scholar 

  4. Khodor, J., Gifford, D.K.: Design and implementation of computational systems based on programmed mutagenesis. BioSystems 52 (1999), 93–97.

    Article  Google Scholar 

  5. Khodor, J., Khodor, Y.: Length-Only Discrimination Approach to Biological Computing. Sixth International Meeting on DNA Based Computers, Leiden, NL, June 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Khodor, Y., Khodor, J., Knight, T.F. (2002). Experimental Confirmation of the Basic Principles of Length-only Discrimination. In: Jonoska, N., Seeman, N.C. (eds) DNA Computing. DNA 2001. Lecture Notes in Computer Science, vol 2340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48017-X_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-48017-X_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43775-8

  • Online ISBN: 978-3-540-48017-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics