Skip to main content
SpringerLink
Log in

Genetic Code-Based DNA Computation for the Hamiltonian Path Problem

  • Chapter
Combinatorial Optimization in Communication Networks

Part of the book series: Combinatorial Optimization ((COOP,volume 18))

  • 875 Accesses

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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, v.266, pp. 1021–1024, Nov. 1994.

    Google Scholar 

  2. D. Boneh and R. Lipton, Making DNA computers error resistant. Technical report, Princetion University, CS-TR-491-495, 1996.

    Google Scholar 

  3. E. Baum and D. Boneh, Running dynamic programming algorithms on a DNA computer. the 2nd DIMACS workshop on DNA based computers, pp. 141–147, 1996.

    Google Scholar 

  4. F. H. C. Crick, The origin of the genetic code. Journal of Molecular Biology, vol. 38, pp. 367–379, 1968.

    Article  Google Scholar 

  5. T. Eng and B. Serridge, A surface-based DNA algorithm for minimal set cover. the 3rd DIMACS workshop on DNA based computers, pp. 74–82, June 1997.

    Google Scholar 

  6. L. R. Jaisingh. Theory and Problems of Abstract algebra. McGraw-Hill, second edition, 2004.

    Google Scholar 

  7. L. Landweber and R. Lipton. DNA2DNA computations: A Potential “Killer App”? the 3rd DIMACS workshop on DNA based computers, pp. 59–68, June 1997.

    Google Scholar 

  8. R. Lipton. Using DNA to solve NP-complete problem. Science, vol. 268, pp. 542–545, April 1995.

    Google Scholar 

  9. C. C. Maley. DNA computation: Theory, practice, and prospects, Evolutionary Computation, vol. 6, no. 3, pp. 201–229, 1998.

    Google Scholar 

  10. W. K. Purves, D. Sadava, G. H. Orians, and H. C. Heller. Life: The Science of Biology, Sinauer, 6th edition, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Life Sciences and Chemical Analysis Division, Agilent Technologies, Palo Alto, CA, 94304

    Mingjun Zhang

  2. Computer Science Department, University of Missouri, Rolla, MO, 65401

    Maggie X. Cheng

  3. Department of Electrical and Systems Engineering, Washington University, St. Louis, MO, 63103

    Tzyh-Jong Tarn

Authors
  1. Mingjun Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maggie X. Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tzyh-Jong Tarn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Missouri, Rolla, Missouri

    Maggie Xiaoyan Cheng

  2. Georgia State University, Atlanta, Georgia

    Yingshu Li

  3. University of Texas at Dallas, Richardson, Texas

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Zhang, M., Cheng, M.X., Tarn, TJ. (2006). Genetic Code-Based DNA Computation for the Hamiltonian Path Problem. In: Cheng, M.X., Li, Y., Du, DZ. (eds) Combinatorial Optimization in Communication Networks. Combinatorial Optimization, vol 18. Springer, Boston, MA. https://doi.org/10.1007/0-387-29026-5_23

Download citation

  • DOI: https://doi.org/10.1007/0-387-29026-5_23

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-29025-6

  • Online ISBN: 978-0-387-29026-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation