%0 Journal Article
%T 0-1 planning problem based on DNA computing<br>0-1规划问题的DNA计算
%A Yin Zhixiang
%A Zhang Fengyue
%A Xu Jin
%A <br>殷志祥
%A 张凤月
%A 许进
%J 电子与信息学报
%D 2003
%I 
%X DNA computing is a novel method for solving a class of intractable computational problem, in which the computing can grow exponentially with problem size. Up to now, many accomplishments have been achieved to improve its performance and increase its reliability. In this paper, a theoretical scheme of solving 0-1 planning problem with fluorescence labeling technique given and used to apply DNA computing to planning problem. This method has some significant advantages such as simple encoding, low cost, short operating time, etc.
%K DNA Computing
%K 0-1 planning problem
%K Feasible solution
%K Fluorescence labeling technique<br>0－1规划
%K DNA计算
%K 可行解
%K 荧光标记技术
%K 电子计算机
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=BA0BB8028F1E8F02&yid=D43C4A19B2EE3C0A&vid=C5154311167311FE&iid=CA4FD0336C81A37A&sid=95D537AC89B28832&eid=5C3443B19473A746&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=16&reference_num=9