Closed circle DNA algorithm for set covering problems

The computation model for closed circle DNA and its biochemistry experiments were introduced. Set covering and its mathematical model were analyzed. According to the principle that feasible set, covering is composed of these sets, of which an arbitrary element belongs to at least a set, closed circle DNA algorithm of set covering problem was designed. In the closed circle DNA algorithm, two groups of DNA encoding for every 0-1 decision variable of set were encoded according to taking values of variable and cost coefficients corresponding to variable; and all possible solutions were synthesized. All feasible solutions were filtered out by doing insert experiment and delete experiment, and the objective function values of these feasible solutions were obtained by doing insert experiment. And all optimization solutions were filtered out by doing electrophoresis experiment. Finally all optimization solutions were putout by doing detect experiment. An example explained feasibility of the DNA algorithm. Detection experiment based on electrophoresis technique is first put forward, which can detect various kinds of DNA encodings using the experiment order of insert experiment-electrophoresis experiment-group separate experiment.