A global heuristically search algorithm for DNA encoding  

作　　者：Zhang Kai Pan Linqiang Xu Jin 

机构地区：[1]The Key Laboratory of Image Processing and Intelligent Control, Department of Control Science and Engineering, Huazhong Universityof Science and Technology, Wuhan 430074, China

出　　处：《Progress in Natural Science:Materials International》2007年第6期745-749,共5页自然科学进展·国际材料（英文版）

基　　金：Supported by National Natural Science Foundation of China (Grant Nos 60533010 ,60373089 ,and 60674106);PhDPrograms Founda-tion of Ministry of Education of China (No 20060487014);Programfor New Century Excellent Talents in University (No NCET-05-0612)

摘　　要：A new efficient algorithm is developed to design DNA words with equal length for DNA computing. The algorithm uses a global heuristic optimizing search approach and converts constraints to a carry number to accelerate the convergence, which can generate a DNA words set satisfying some thermodynamic and combinatorial constraints. Based on the algorithm, a software for DNA words design is developed.A new efficient algorithm is developed to design DNA words with equal length for DNA computing. The algorithm uses a global heuristic optimizing search approach and converts constraints to a carry number to accelerate the convergence, which can generate a DNA words set satisfying some thermodynamic and combinatorial constraints. Based on the algorithm, a software for DNA words design is developed.

关 键 词：DNA computing ENCODING heuristic optimizing search 

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