首页 | 本学科首页   官方微博 | 高级检索  
     

最大加权独立集问题的DNA算法
引用本文:吴雪, 赵艺. 最大加权独立集问题的DNA算法[J]. 电子与信息学报, 2007, 29(11): 2693-2697. doi: 10.3724/SP.J.1146.2006.00614
作者姓名:吴雪  赵艺
作者单位:华东理工大学电子与通信工程系,上海,200237;华东理工大学电子与通信工程系,上海,200237
摘    要:该文基于分子生物技术提出了一种求解最大加权独立集(MWIS)问题的DNA算法。MWIS是最大独立集(MIS)的母问题,而MIS是著名的NP完全问题。该算法的关键技术是基于变长的DNA序列来对所给图中的加权顶点进行合理的编码,并在建立初始完备数据链中采用并行重叠放大(POA)技术,然后应用变性、退火、 聚合酶链式反应(PCR)、酶切反应和凝胶电泳等一系列的DNA生物操作和计算生成可行解和分离出所要求的最大加权独立集。最后给出了该算法的计算机模拟仿真结果,得到了所给问题的最大加权独立集,对算法的可行性进行了验证和总结。

关 键 词:DNA计算  独立集  NP完全问题  生物技术
文章编号:1009-5896(2007)11-2693-05
收稿时间:2006-05-08
修稿时间:2006-05-08

DNA Solution of the Maximum Weighted Independent Set
Wu Xue, Zhao Yi. DNA Solution of the Maximum Weighted Independent Set[J]. Journal of Electronics & Information Technology, 2007, 29(11): 2693-2697. doi: 10.3724/SP.J.1146.2006.00614
Authors:Wu Xue  Zhao Yi
Affiliation:Dept. of Electronic & Communication Engineering, East China University of Science and Technology, Shanghai 200237, China
Abstract:The DNA solution of the Maximum Weighted Independent Set(MWIS) problem based on biological technology is primarily presented in this paper. The MWIS problem is a well-known NP complete problem. The crucial point in the algorithm is to use of direct proportional length-based DNA strands to encode the vertices in weighed graphs and POA to build complete data pool,respectively,then the result comes out by a series of biological reaction and computation such as denaturation,anneal,Polymerase Chain Reaction(PCR) ,gel electrophoresis. And the maximum weighted independent set of the graph is found. Finally,the computer program is given to simulate this algorithm and the MWIS of the graph is also found,and the feasibility of the algorithm is validated and summarized.
Keywords:DNA computing  Independent set  NP-complete problem  Biological technology
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号