Closed Circle DNA Algorithm of Hamilton Circuit Problem

Closed circle DNA used in the paper has equal length. For different closed circle DNA, the same position is corresponding to different recognition sequence, and the same recognition sequence is corresponding to different foreign DNA segment. Closed circle DNA algorithm of Hamilton circuit problem is put forward. In the algorithm, three groups of DNA encoding are encoded for all arcs, and deck groups are designed for all vertices. All possible solutions are synthesized. Then, the feasible solutions are filtered out by group detect experiment, and the optimization solutions are obtained by group insert experiment and electro-phoresis experiment. Finally, all optimization solutions are put-out by detect experiment. Complexity of algorithm is concluded and validity of DNA algorithm is explained by an example. Two dominances of the closed circle DNA algorithm are analyzed.