单约束背包问题的DNA算法  

The DNA algorithm of single-restriction knapsack problem

作　　者：彭镇静[1] 王建中[1] 赵永耀[1] 

机构地区：[1]中北大学理学院,山西太原030051

出　　处：《山东理工大学学报（自然科学版）》2011年第4期71-73,共3页Journal of Shandong University of Technology:Natural Science Edition

摘　　要：提出了单约束非0-1整数背包问题的DNA计算方法,即变量的取值用DNA分子编码进而并合成所有可行解;并由批接入实验、电泳实验推出最优解;通过检测实验得出所有的最优解.并举例验证此算法的可行性.This paper gives a method to solve single-restriction not 0-1 integer knapsack problem with DNA computation.DNA encoding for all values of any variable was applied and all possible solutions were synthesized.And all optimized solutions were filtered out using group insert experiment and electrophoresis experiment.Finally all optimized solutions were found using detecting experiments.And an example explains the feasibility of the DNA algorithm.

关 键 词：DNA算法 单约束背包问题 批接入实验 批删除实验 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]