Recently, DNA computing is one of powerful tools that can be designed for solving NP-complete problems. The powers of DNA computing are that it has great ability of massive data storage and it can process those data in parallel. Some of hard problems, such as the traveling salesperson problem and the Hamiltonian cycle problem, have been solved with the brute force method in DNA computing. After DNA computing is performed, all feasible solutions for the problem are stored implicitly in the tubes. However, the correct answer still cannot be extracted or reported absolutely, because that the concentration of the correct solutions might be lower than other bad solutions. In this paper, we will increase the concentration of the correct answer for fault-tolerant ability.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0821103-194744 |
| Date | 21 August 2003 |
| Creators | Hsu, Chie-Yao |
| Contributors | Chin Lung Lu, Zin-Huang Liu, C.B. Yang, Yue-Li Wang, Yow-ling Shine |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0821103-194744 |
| Rights | restricted, Copyright information available at source archive |
Page generated in 0.0021 seconds