%0 Journal Article
%T DNA sequence design problem and complexity analysis<br>DNA编码问题及其复杂性研究*
%A ZHANG Kai
%A GENG Xiu tang
%A XIAO Jian hu
%A ZHANG Xun cai
%A <br>张凯
%A 耿修堂
%A 肖建华
%A 张勋才
%J 计算机应用研究
%D 2008
%I 
%X High quality DNA sequences can prevent the interference between different DNA molecules, and improve the reliability and effectiveness of DNA computation. At first, classified DNA constraints, and analyzed the influence of constraints on the quality of DNA sequences. Then the paper studied the relationship between DNA sequence and the efficiency of DNA computing. Finally, the paper carried on the analogy to DNA sequence design problem and graph independent set problem, and proved the maximum DNA sequences set problem was a NP complete problem.
%K DNA computing
%K DNA sequences design
%K combinatorial optimization<br>DNA计算
%K DNA编码设计
%K 组合优化
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=A2E6A4D0ABED781BE836599EAFCD9452&yid=67289AFF6305E306&vid=C5154311167311FE&iid=708DD6B15D2464E8&sid=FF1E6F72756FD105&eid=A1374D6ABE9C0DC0&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=1&reference_num=15