期刊文献+

最大加权独立集问题的DNA算法 被引量:6

DNA Solution of the Maximum Weighted Independent Set
在线阅读 下载PDF
导出
摘要 该文基于分子生物技术提出了一种求解最大加权独立集(MWIS)问题的DNA算法。MWIS是最大独立集(MIS)的母问题,而MIS是著名的NP完全问题。该算法的关键技术是基于变长的DNA序列来对所给图中的加权顶点进行合理的编码,并在建立初始完备数据链中采用并行重叠放大(POA)技术,然后应用变性、退火、聚合酶链式反应(PCR)、酶切反应和凝胶电泳等一系列的DNA生物操作和计算生成可行解和分离出所要求的最大加权独立集。最后给出了该算法的计算机模拟仿真结果,得到了所给问题的最大加权独立集,对算法的可行性进行了验证和总结。 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.
作者 吴雪 赵艺
出处 《电子与信息学报》 EI CSCD 北大核心 2007年第11期2693-2697,共5页 Journal of Electronics & Information Technology
关键词 DNA计算 独立集 NP完全问题 生物技术 DNA computing Independent set NP-complete problem Biological technology
  • 相关文献

参考文献14

  • 1Adleman L, Molecular computation of solution to combinatorial problems. Science, 1994, 266(11): 1021-1024.
  • 2Maley C C. DNA Computation: theory, practice, and prospects, Evolutionary Computation, 1998, 6(3): 201-229.
  • 3董亚非,谭刚军,张社民.基于粘贴系统求解TSP问题[J].系统仿真学报,2005,17(6):1299-1302. 被引量:5
  • 4Ouyang Q, Kaplan P D, and Liu Shumao, et al.. DNA solution of maximal clique problem, Science, 1997, 278(17):446-449.
  • 5高琳,许进.最小顶点覆盖问题的DNA分子算法[J].系统工程与电子技术,2004,26(4):544-548. 被引量:9
  • 6杨铀,段滋明.求解图的最大独立集的一种算法[J].电脑开发与应用,2002,15(6):13-14. 被引量:8
  • 7李有梅,徐宗本,孙建永.一类求解最大独立集问题的混合神经演化算法[J].计算机学报,2003,26(11):1538-1545. 被引量:9
  • 8Head T, et al.. Computing with DNA by operating on plasraids. Biosystems, 2000, 57(2): 87-93.
  • 9Kaplan P D, Ouyang Q and Thaler D S, et al.. Parallel overlap assembly for the construction of computational DNA libraries. Journal of Theoretical Biology, 1997, 188(3): 333-341.
  • 10Ibrahim Z. Towards solving weighted graph problems by directproportional length-based DNA computing, Research Report, IEEE Computational Intelligence Society(CIS)Walter J Karplus Summer Research Grant 2004.

二级参考文献35

  • 1Adleman L. Molecular Computation of Solution to Combinatorial Problems[J]. Science, 1994,266 (11):1021-1024.
  • 2Gibbons A. Algorithmic Graph Theory[M]. Cambridge University Press, Cambridge, London,1985.
  • 3Lipton Richard J. DNA Solution of Computation Problems[J]. Science, 1995,268(4):542-545.
  • 4Ouyang Q. Solution of the Maximal Clique Problem[J]. Science, 1997,278(17):446-449.
  • 5Perez M J. Solving Kanpsack Problems in a Sticker Based Model[EB/OL]. http://www.cas.ust.edu/dna, 2002.
  • 6Rowise S. A Sticker Based Models for DNA Computation[EB/OL]. http://www.corninfo.chem. wisc.edu, 2002.
  • 7Gao Lin, Xu Jin. DNA Solution of Vertex Cover Problem Based on Sticker Model[J]. Chinese Journal of Electronics, 2002,11(2):280-284.
  • 8Boneh D. On the Computation Power of DNA[R]. Technical Report TR-499-95,Prinecton University,USA,1995.
  • 9Garzon M H. Biomolecular Computing and Programming[J]. IEEE Trans. on Evolutionary Computation, 1999,3(3):236-250.
  • 10Garzon H. The Bounded Complexity of DNA Computing[J]. Biosystems,1999,52:63-72.

共引文献26

同被引文献52

  • 1王雷,林亚平.DNA计算在整数规划问题中的应用[J].电子与信息学报,2005,27(5):814-818. 被引量:10
  • 2许进,黄布毅.DNA计算机:原理、进展及难点(Ⅱ)计算机“数据库”的形成——DNA分子的合成问题[J].计算机学报,2005,28(10):1583-1591. 被引量:13
  • 3周康,刘文斌,许进.TSP的DNA计算算法[J].系统工程与电子技术,2007,29(2):316-319. 被引量:15
  • 4Majid D. A new solution for maximal clique problem based sticker model. Biosystems, 2009, 95:145-149.
  • 5Lipton R J. DNA solution of hard computational problems, Science, 1995, 268:542-545.
  • 6Adleman L M. Molecular computation of solutions to combinatorial problems. Science, 1994, 266:1021-1024.
  • 7Ouyang Q, Kaplan P D, Liu S, et al. DNA solution of the maximal clique problem. Science, 1997, 278:446-449.
  • 8Liu Q H, Wang L M, Frutos A G, et al. DNA computing on surfaces. Nature, 2000, 403:175 178.
  • 9Rothemund P W K. Folding DNA to create nanoscale shapes and patterns. Nature, 2006, 440:297-302.
  • 10Mao C D, LaBean T H, ReifJ H, et al. Logical computation using algorithmic self-assembly of DNA triplecrossover molecules. Nature, 2000, 407:493-496.

引证文献6

二级引证文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部