USING DNA COMPUTING TO SOLVE MINIMUN SPANNING TREE PROBLEM

摘要：

DNA computing is a modern and very active research area investigating the use of biomolecules for the purpose of computing. In this paper, we introduce a DNA encoding method to represent numerical values. DNA strands are designed to encode real values by variation of their temperatures. The proposed method was successfully applied to the minimum spanning tree problem, an instance of optimization problems on weighted graph.

关键词： DNA Computing Minimum Spanning Tree Coding Scheme Genetic Algorithms

作者: Yan Li

作者单位: Department of Computer Science and Technology Weifang University,Weifang, China

会议类型: 国际会议

会议名称: China-Ireland International Conference on Information and Communications Technologies 2008(2008 中国-爱尔兰信息与通信技术国际会议 CIICT 2008)

会议地点: 北京

会议语种:英文

页码: 1-4

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