DNA Computing on the Shortest Path in Traveling Salesman Problem
碩士 === 國立東華大學 === 生物技術研究所 === 93 === Leonard M. Adleman performed the pioneer experiment in 1994 to demonstrate that DNA computing could be used in solving the direct Hamiltonian path problem, one of the famous NP-complete problems in computer science. In this work, we described a method based on DN...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/68758072215230732256 |