An Algorithm of Assignment Problem Based on Closed Circle DNA
基于闭环DNA的指派问题算法

In this paper, a model of closed circle DNA computing and its bio-chemistry experiments are brought forward. An algorithm based on closed circle DNA is designed for assignment problem. In the algorithm, first planar DNA encoding for each decision-maklng variable is encoded to deposit each decision-making variable and benefit value. Then all feasible solutions are gained with purposive ending technology and delete experiment. And then all optimization solutions are obtained with electrophoresis experiment and detect experiment. Feasibility of this algorithm is explained by an example. Finally two improving methods of this algorithm are discussed in order to decrease number of DNA encodings and to shorten encoding length of DNA encodings.