THE IMPROVEMENT ON ALGORITHM OF DNA COMPUTING ON 0-1 PLANNING PROBLEM

摘要：

The old algorithm to solve 0-1 planning problem using DNA computing only searches the feasible solution set from all solution set, then we give an algorithm which can search optimization solution of 0-1 planning problem from all solution set by encoding specially solution set, using technique of electrophoresis and fluorescence labeling technique, and then we give an example to explain the algorithm validity and correctness. We also give a kind of strategy to deal with the negative real number of value coefficient and the complexity of our algorithm is O(m).

关键词： DNA chip DNA computing 0-1 planning problem technique of electrophoresis fluorescence labeling technique

作者: KANG ZHOU XIAO-JUN TONG JIN XU

作者单位: Department of Mathematics and Physics, Wuhan Polytechnic University,Wuhan 430023,China;Department of Department of Control Science and Engineer, Huazhong University of Science and Technology,Wuhan 4300

会议类型: 国际会议

会议名称: 2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

会议地点: 大连

会议语种:英文

页码: 4282-4286

在线出版日期: 2006-08-13（万方平台首次上网日期，不代表论文的发表时间）