DNA Computation for a Category of Special Integer Planning Problem
DNA计算在整数规划问题中的应用

Biochemical reaction theory based DNA computation is of much better performance in solving a class of intractable computational problems such as NP-complete problems, it is important to study the DNA computation. A novel algorithm based on DNA computation is proposed, which solves the problem of a category of special integer planning problem by using the method of fluorescence labeling in the surface based approach to DNA computation. By utilizing the techniques of fluorescence distinguishing, the new algorithm can eliminate all of those false solutions through observing the fluorescence on the surface of DNA molecules. Algorithm analyses show that the new proposed algorithm based on DNA computation has such good characteristics as simple encoding and low fault rate etc.