A surface-based DNA algorithm for the solving binary knapsack problem

摘要

Molecular biology suggests a new method for solving an NP-complete problem. The idea (due to Leonard Adleman) is to use strands of DNA to encode the (instance of the) problem and to manipulate using techniques commonly available in any molecular biology laboratory. The knapsack problem is An NP-complete. In this paper we solved the binary knapsack problem by DNA computing on surface.