作者机构：
[Zhou Kang; Tong Xiaojun] Wuhan Polytech Univ, Dept Math & Phys, Wuhan 430023, Peoples R China.;[Zhou Kang; Tong Xiaojun; Xu Jin] Huazhong Univ Sci & Technol, Dept Control Sci & Engineer, Wuhan 430074, Peoples R China.
通讯机构：
[Zhou Kang] W;Wuhan Polytech Univ, Dept Math & Phys, Wuhan 430023, Peoples R China.
关键词：
closed circle DNA computing model;change positive-weighted Hamilton circuit problem;group insert experiment;group delete experiment
摘要：
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.
通讯机构：
State Education Department Key Laboratory for Image Processing and Intelligence Control, Institute of Pattern Recognition and Artificial Intelligence, Huazhong University of Science and Technology, China
