期刊文献+

哈密尔顿回路问题的DNA表面计算模型 被引量:3

Surface-based DNA algorithm for Hamiltonian path problem
下载PDF
导出
摘要 首次提出用DNA表面计算模型来解决无向图哈密尔顿回路问题。该模型基于哈密尔顿回路问题的解空间,将问题解空间的DNA分子固定在固体载体上,对其进行荧光标记,然后通过相应的生化反应筛选出哈密尔顿回路问题的所有解。与已有的哈密尔顿路径问题的其它模型相比,新模型具有错误率低,编码简易,读取方便等更好的性能。 The paper innovatively presents a surface-based DNA algorithm for solving Hamiltonian circuit problem in a nondirectional graph.The model,based on the solution space of Hamihonian problem,fixes the DNA molecules of solution space on the solid carrier,and fluorescence labels on them,and then gets all solutions of Hamiltonian circuit problem by certain biochemical actions.Compared with other models for Hamiltonian path problem,this model shows better performances on low rate of error,easily coding and conveniency to read.
出处 《计算机工程与应用》 CSCD 北大核心 2010年第8期48-51,共4页 Computer Engineering and Applications
基金 国家自然科学基金Grant No.60603053 国家自然科学基金重大项目Grant No.90715029 湖南省重点建设学科项目 湖南省教育厅项目 Grant No.09C546~~
关键词 DNA超级计算 表面计算模型 NP完全问题 哈密尔顿回路问题 DNA supercomputing surface-based computing model NP-complete problem Hamihonian circuit problem
  • 相关文献

参考文献15

  • 1Adleman L M.Molecular computation of solutions to combinatorial problems[J].Science, 1994,266:1021-1024.
  • 2Lipton R J.Speeding up computations via molecular biology[R]. Princeton University, 1994.
  • 3Lipton R J.DNA solution of hard computational problems[J].Science, 1995,268 : 542-545.
  • 4Ouyang Q,Kaplan P D,Liu S,et al.Solution of the maximal clique problem[J].Science, 1997,278 ( 17 ) : 446-449.
  • 5Head T,Rozenberg G,Bladergroen R S,et al.Computing with DNA by operating on plasmids[J].Biosystems, 2000,57 : 87-93.
  • 6Braieh R S,Chelyapov N,Johnson C.Solution of a 20-variable 3- SAT problem on a DNA computer[J].Seienee,2002,296(19):499- 502.
  • 7Liu Q,Wang L,Frutos A G,et al.DNA computing on surface[J]. Nature, 2000,403 ( 13 ) : 175-179.
  • 8Wu H.An improved surface-based method for DNA computation[J]. Biosystems, 2001,59 : 1-5.
  • 9刘文斌,高琳,王淑栋,刘向荣,许进.最大匹配问题的DNA表面计算模型[J].电子学报,2003,31(10):1496-1499. 被引量:19
  • 10Martinez-Perez I M,Zimmermann K H.Parallel bioinspired algorithms for NP complete graph problems[J].Joumal of Parallel and Distributed Computing, 2009,69: 221-229.

二级参考文献52

  • 1QUHuiqin LUMingming ZHUHong.Solve the partitioning problem by sticker model in DNA computing[J].Progress in Natural Science:Materials International,2004,14(12):1116-1121. 被引量:1
  • 2李肯立,姚凤娟,李仁发,许进.基于分治的背包问题DNA计算机算法[J].计算机研究与发展,2007,44(6):1063-1070. 被引量:20
  • 3Q Liu, et al. DNA computing on surfaces[ J ]. Nature, 2000,403:175 -179.
  • 4H Wu. An improved surface-based method for DNA computation [J].Boisystem, 2001,59:1 - 5.
  • 5J A Bondy, USR Murty. Graph Theory with Application [ M ]. the Macmillan Press LTD. London: Basingtoke and New York, 1976.
  • 6L Adleman. Molecular computation of solution to combinatorial problems [J]. Science, 1994,266 ( 11 ) : 1021 - 1024.
  • 7R J Lipton. DNA solution of hard computational problems [J]. Science,1995,268(4) :542 - 545.
  • 8Q Ouyang, et al. DNA solution of the maxinml clique problem [ J ]. Science, 1997,278(17) :446 - 449.
  • 9T Head, et al. Computing with DNA by operation on plasmids [J].Biosystems 2000,57: 87 - 93.
  • 10M Smith et al. A surface-based approach to DNA computation [ J ].Journal of Computational biology, 1998,5:255 - 267.

共引文献35

同被引文献20

引证文献3

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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