Solving some mathematical problems such as NP-complete problems by conventional silicon-based computers is problematic and\r\ntakes so long time. DNA computing is an alternative method of computing which uses DNA molecules for computing purposes.\r\nDNA computers have massive degrees of parallel processing capability. The massive parallel processing characteristic of DNA\r\ncomputers is of particular interest in solving NP-complete and hard combinatorial problems. NP-complete problems such as\r\nknapsack problem and other hard combinatorial problems can be easily solved by DNA computers in a very short period of time\r\ncomparing to conventional silicon-based computers. Sticker-based DNA computing is one of the methods of DNA computing. In\r\nthis paper, the sticker based DNA computing was used for solving the 0/1 knapsack problem. At first, a biomolecular solution space\r\nwas constructed by using appropriate DNAmemory complexes. Then, by the application of a sticker-based parallel algorithm using\r\nbiological operations, knapsack problem was resolved in polynomial time.
Loading....