| ¡¡ | Chinese Journal of Computers Full Text |
| Title | DNA Ligation Design and Biological Realization of Knapsack Problem |
| Authors | ZHU Ying1) REN Li-Hong1) DING Yong-Sheng1),2) Kongsuwan Kritaya3) |
| Address | 1)(College of Information Sciences and Technology, Donghua University, Shanghai 201620) 2)(Engineering Research Centre of Digitized Textile and Fashion Technology of Ministry of Education, Donghua University, Shanghai 201620) 3)(CSIRO Livestock Industries, Queensland Bioscience Precinct, St Lucia QLD 4072, Australia) |
| Year | 2008 |
| Issue | No.12(2207¡ª2214) |
| Abstract & Background | Abstract More attention has been paid to DNA computing for Knapsack Problem (KP). The authors realized the biological experiment of parallel searching to solve KP, and used the most optimized method to select items within a limited knapsack. The DNA fragments designing is based on reactions and the computational procedure is high-efficiency DNA ligation. Two methods were used to detect the results. They are PCR (quantitative analysis) and sequencing (qualitative analysis). It is suitable to the optimization of multiple restriction conditions. Keywords knapsack problem; DNA computing; primers design; high-efficiency ligation; clone sequencing |