Advanced Search
Volume 29 Issue 11
Jan.  2011
Turn off MathJax
Article Contents
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
Citation: 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

DNA Solution of the Maximum Weighted Independent Set

doi: 10.3724/SP.J.1146.2006.00614
  • Received Date: 2006-05-08
  • Rev Recd Date: 2006-11-16
  • Publish Date: 2007-11-19
  • 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.
  • loading
  • Adleman L. Molecular computation of solution to combinato- rial problems[J].Science.1994, 266(11):1021-1024[2]Maley C C. DNA Computation: theory, practice, and pros- pects[J].Evolutionary Computation.1998, 6(3):201-229[3]董亚非, 谭刚军, 等. 基于粘贴系统求解TSP问题. 系统仿真学报, 2005, 17(6): 1299-1306.[4]Ouyang Q, Kaplan P D, and Liu Shumao, et al.. DNA solution of maximal clique problem[J].Science.1997, 278(17):446-449[5]高琳, 许进. 最小顶点覆盖问题的DNA分子算法. 系统工程与电子技术, 2004, 26(4): 544-548.[6]杨铀, 段滋明. 求解图的最大独立集的一种算法. 电脑开发与应用, 2002, 15(6): 13-14.[7]李有梅, 徐宗本, 孙建永. 一种求解最大独立集问题的混合神经演化算法. 计算机学报, 2003, 26(11): 1538-1545.[8]Head T, et al.. Computing with DNA by operating on plas- mids[J].Biosystems.2000, 57(2):87-93[9]Kaplan P D, Ouyang Q and Thaler D S, et al.. Parallel overlap assembly for the construction of computational DNA libraries[J].Journal of Theoretical Biology.1997, 188(3):333-341[10]Ibrahim Z. Towards solving weighted graph problems by di- rectproportional length-based DNA computing. Research Re- port, IEEE Computational Intelligence Society(CIS)Walter J Karplus Summer Research Grant 2004.[11]G.Paun.[J].G. Rozenberg, et al.. (德)著. 许进. 等. 译. DNA计算.清华大学出版社.2004,:-[12]Amos M. DNA computation[PhD Thesis], The University of Warwick, UK, 1997.[13]Sambrook J, Fritsch E F and Maniatis T. Molecular Cloning. NY: Cold Spring Harbor Laboratory Press, 1987: 1-56.[14]Ferretti C, Mauri G, and Zandron C. DNA computing. Heidelberg: Springer Berlin, 2005: 215-223.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (3285) PDF downloads(1842) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return