期刊文献+

最大匹配问题的三链DNA计算模型 被引量:5

Triple-stranded DNA Computing Model of Maximum Matching Problem
在线阅读 下载PDF
导出
摘要 三螺旋结构的DNA链具有稳定性,在一定条件下易分解等特点,因此得到的三链模型具有错解率低的优点。利用三链模型来讨论最大匹配问题,拓展了DNA计算解决问题的方法和应用领域。 Triple - stranded DNA has the features of stability, and under certain conditions can be easily decom- posed. Triple - stranded DNA model has advantages of low rate of wrong solutions. The triple - stranded DNA model was used to discuss the maximum matching problem, which expands method for solving the problem and application field of DNA computation.
出处 《安徽理工大学学报(自然科学版)》 CAS 2012年第4期47-49,共3页 Journal of Anhui University of Science and Technology:Natural Science
关键词 DNA计算 三链DNA 最大匹配 DNA computing triple- stranded DNA maximum matching
  • 相关文献

参考文献10

  • 1LIU QINGHUA,LIMAN WANG,ANTHONY G FRUTOS. DNA computing on surfaces[J].Nature,2000,(13):175-178.
  • 2GAO LIN,XU JIN. DNA solution of vertex cover problem based on sticker model[J].Chinese Journal of Electronics,2002,(02):280-284.
  • 3KARL HEINZ ZIMMERMANN. Efficient DNA sticker algorithms for NP complete graph problems[J].Computer Physics Communications,2002.297-309.
  • 4BRAICH R S,CHELYAPOV N JOHNSON. Solution of a 20-varaiable3-SAT problem on a DNA computer[J].Science,2002.499-502.
  • 5BENENSON Y,TAMAR P,ADAR R. Programmable and autonomous computing machine made of biomoleccules[J].Nature,2001,(22):430-434.
  • 6许进,董亚非,魏小鹏.粘贴DNA计算机模型(Ⅰ):理论[J].科学通报,2004,49(3):205-212. 被引量:33
  • 7许进,李三平,董亚非,魏小鹏.粘贴DNA计算机模型(Ⅱ):应用[J].科学通报,2004,49(4):299-307. 被引量:32
  • 8S TYAGI,F R KRAMER. Molecular beacon:probes that fluoresce upon hybridization[J].Nature Biotechnology,1996.303-308.
  • 9SHIGEMORI Y,OISHI M. Specific cleavage of DNA molecules at RecA-mediated triple-stranded structure[J].Nucleic Acids Research,2004,(15):4563-4575.
  • 10RAO B J,DUTREIX M,RADDING C M. Stable three-stranded DNA made by RecA protein[J].Proceedings of the National Academy of Sciences(USA),1991,(08):2984-2988.

二级参考文献7

共引文献39

同被引文献41

  • 1凌春莹,于丽杰.适于转基因大白菜检测的DNA高效提取方法[J].牡丹江师范学院学报(自然科学版),2005,31(2):19-20. 被引量:3
  • 2李肯立,姚凤娟,李仁发,许进.基于分治的背包问题DNA计算机算法[J].计算机研究与发展,2007,44(6):1063-1070. 被引量:20
  • 3刘毅,宋玉阶.收缩背包问题的DNA算法[J].计算机工程与科学,2007,29(8):55-57. 被引量:1
  • 4Adlenlan L. Molecular computation of solutions to combina torial problems[J]. Science, 1994,266 : 1021-- 1024.
  • 5Tyagi S, Kramer F R. Molecular beacon: probes that fluo- resce upon hybridization [J ]. Nat Biotechnoll, 1996, 14: 303--308.
  • 6Yin Zhixiang, Cui Jianzhong. Molecular beacon-based DNA computing model for maximum weight clique problem[C]// Bio-Inspired Computing, 2009: 84-- 87.
  • 7Yin Zhixiang, Cui Jianzhong, Yang Jing, et al. DNA compu- ting model of the integer linear programming problem based on molecular beacon [J ]. Bio-information, 2006, 4115: 238--247.
  • 8Yin Zhixiang, Song Bosheng, Zhen Cheng, et al. Molecular beacon-based DNA computing model for maximum inde- pendent set problem[C]//International Computation Tech nology and Automation, 2010 : 732-- 735.
  • 9Huang Xiaohui, Yin Zhixiang, Zhi Lingying, et al. Molecular beacon based on DNA computing model for 0-1 program- ming problem[C]//Bio-inspired Computing, 2009 : 1-- 5.
  • 10殷志祥,许进.分子信标芯片计算在0-1整数规划问题中的应用[J].生物数学学报,2007,22(3):559-564. 被引量:18

引证文献5

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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