%0 Journal Article
%T An Algorithm of Assignment Problem Based on Closed Circle DNA<br>基于闭环DNA的指派问题算法
%A ZHOU Kang
%A TONG Xiao-Jun
%A XU Jin
%A <br>周康
%A 同小军
%A 许进
%J 计算机科学
%D 2007
%I 
%X 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.
%K Model of closed circle DNA computing
%K Assignment problem
%K Delete experiment
%K Checking experiment<br>闭环DNA计算模型
%K 指派问题
%K 删除实验
%K 有目的的终止技术
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=C832FD9F9933AD89EFA7585B99AC2565&yid=A732AF04DDA03BB3&vid=339D79302DF62549&iid=59906B3B2830C2C5&sid=CC0ECB9C52F1B85F&eid=527AEE9F3446633A&journal_id=1002-137X&journal_name=计算机科学&referenced_num=5&reference_num=8