期刊文献+

运用DNA计算解决最短路径问题

Using DNA Computing to Solve the Shortest Path Problem
下载PDF
导出
摘要 用通俗易懂的语言解释了最短路概念以及解决多顶点最短路问题面临的困境,介绍了DNA计算的研究背景,阐明了DNA计算解决最短路的优势以及算法步骤,并对DNA计算的未来发展作出展望。 The paper uses plain language to explain the concept of the short circuit and the plight of the solving the problem of wide range of vertices of the short circuit ,it also introduceS the background of DNA computing .The advantage of the DNA computing and Algorithm steps to solve the short circuit has also been introduced ,and the prospects of DNA compu‐ting has been introduced .
作者 张喆
出处 《软件导刊》 2015年第4期39-40,共2页 Software Guide
关键词 最短路 DNA计算 单链 k-臂分子 The Short Circuit DNA Computing Single Line K-arm
  • 相关文献

参考文献5

二级参考文献56

  • 1邓少平,欧阳皓.DNA计算的一些基本问题[J].科学(中文版),1996(5):51-54. 被引量:7
  • 2Majid D. A new solution for maximal clique problem based sticker model. Biosystems, 2009, 95:145-149.
  • 3Lipton R J. DNA solution of hard computational problems, Science, 1995, 268:542-545.
  • 4Adleman L M. Molecular computation of solutions to combinatorial problems. Science, 1994, 266:1021-1024.
  • 5Ouyang Q, Kaplan P D, Liu S, et al. DNA solution of the maximal clique problem. Science, 1997, 278:446-449.
  • 6Liu Q H, Wang L M, Frutos A G, et al. DNA computing on surfaces. Nature, 2000, 403:175 178.
  • 7Rothemund P W K. Folding DNA to create nanoscale shapes and patterns. Nature, 2006, 440:297-302.
  • 8Mao C D, LaBean T H, ReifJ H, et al. Logical computation using algorithmic self-assembly of DNA triplecrossover molecules. Nature, 2000, 407:493-496.
  • 9Seelig G, Soloveichik D, Zhang Y D, et al. Enzyme-free nucleic acid logic circuits. Science, 2006, 314:1585-1588.
  • 10Kensaku S, Hidetaka G, Ken K, et al. Molecular computation by DNA hairpin formation. Science, 2000, 288:1223-1226.

共引文献53

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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