Closed circle DNA algorithm of change positive-weighted Hamilton circuit problem  

作　　者：Zhou Kang Tong Xiaojun Xu Jin 

机构地区：[1]Dept. of Mathematics and Physics, Wuhan Polytechnic Univ., Wuhan 430023, P. R. China [2]Dept. of Control Science and Engineer, Huanzhong Univ. of Science and Technology, Wuhan 430074, P. R. China

出　　处：《Journal of Systems Engineering and Electronics》2009年第3期636-642,共7页系统工程与电子技术（英文版）

基　　金：supported by the National Natural Science Foundation of China(60574041);the Natural ScienceFoundation of Hubei Province(2007ABA407).

摘　　要：Chain length of closed circle DNA is equal. The same closed circle DNA＇s position corresponds to different recognition sequence, and the same recognition sequence corresponds to different foreign DNA segment, so closed circle DNA computing model is generalized. For change positive-weighted Hamilton circuit problem, closed circle DNA algorithm is put forward. First, three groups of DNA encoding are encoded for all arcs, and deck groups are designed for all vertices. All possible solutions are composed. Then, the feasible solutions are filtered out by using group detect experiment, and the optimization solutions are obtained by using group insert experiment and electrophoresis experiment. Finally, all optimization solutions are found by using detect experiment. Complexity of algorithm is concluded and validity of DNA algorithm is explained by an example. Three dominances of the closed circle DNA algorithm are analyzed, and characteristics and dominances of group delete experiment are discussed.Chain length of closed circle DNA is equal. The same closed circle DNA＇s position corresponds to different recognition sequence, and the same recognition sequence corresponds to different foreign DNA segment, so closed circle DNA computing model is generalized. For change positive-weighted Hamilton circuit problem, closed circle DNA algorithm is put forward. First, three groups of DNA encoding are encoded for all arcs, and deck groups are designed for all vertices. All possible solutions are composed. Then, the feasible solutions are filtered out by using group detect experiment, and the optimization solutions are obtained by using group insert experiment and electrophoresis experiment. Finally, all optimization solutions are found by using detect experiment. Complexity of algorithm is concluded and validity of DNA algorithm is explained by an example. Three dominances of the closed circle DNA algorithm are analyzed, and characteristics and dominances of group delete experiment are discussed.

关 键 词：closed circle DNA computing model change positive-weighted Hamilton circuit problem group insert experiment group delete experiment. 

分 类 号：O157.5[理学—数学] O441.1[理学—基础数学]