期刊文献+

中国邮递员问题的DNA计算 被引量:7

DNA computation for Chinese Postman Problem
下载PDF
导出
摘要 提出了"虚拟权值"和"虚拟节点"的概念,给出了中国邮递员问题的一种基于DNA计算的求解算法。新算法首先利用多聚酶链式反应技术来排除非解,从而得到中国邮递员问题的所有可行解;然后,结合基于表面的DNA计算方法与荧光标记等技术,最终从所有可行解中析出最优解。算法分析表明,新算法具有易于解读、编码简单等特点。 Such new concepts as virtual weight and virtual node were proposed, and based on which, a novel algorithm based on DNA computation was designed to solve the Chinese Postman Problem (CPP). In the new proposed algorithm, all the feasible solutions of the CPP were obtained by utilizing the Polymerase Chain Reaction (PCR) techniques to eliminate false solutions from all the possible solutions, and then, the optimal solutions were extracted from those feasible solutions by; utilizing surface-based techniques for DNA computation and fluorescence-labeling. The results indicate that the new algorithm has good characteristics such as simple encoding and readability.
作者 李玮 王雷
出处 《计算机应用》 CSCD 北大核心 2009年第7期1880-1883,共4页 journal of Computer Applications
关键词 DNA计算 中国邮递员问题 多聚酶链式反应 NP完全问题 DNA computing Chinese Postman Problem (CPP) Polymerase Chain Reaction (PCR) NP-complete problem
  • 相关文献

参考文献10

  • 1ALDERMAN L M. Molecular computations to combinatorial problems[ J]. Science, 1994, 266(11) : 1021 - 1024.
  • 2LIPTON R. Using DNA to solve NP-Complete Problems[ J]. Science, 1995, 268(4) : 542 -545.
  • 3SAKAMOTO K, KOMIYA K, KIGA D, et al. Molecular computation by DNA hairpin formation[ J]. Science, 2000, 288(5): 1223 - 1226.
  • 4LIU Q, GUO Z, FEI Z, et al. A surface based approach to DNA computation[ J]. Journal of Computational Biology, 1998, 5 (2) : 255 - 267.
  • 5WU HAOYANG. An improved surface based method for DNA computation[J]. Bio-systems, 2001, 59(1) : 1 -5.
  • 6殷志祥,张凤月,许进.0-1规划问题的DNA计算[J].电子与信息学报,2003,25(1):62-66. 被引量:40
  • 7WANG LEI. DNA-based algorithm for 0-1 planning problems[ C]// Computational Science and Its Applications. Berlin: Springer, 2005:733-742.
  • 8王雷,林亚平,李智勇.一类特殊整数规划问题的DNA计算[J].计算机研究与发展,2005,42(8):1431-1437. 被引量:9
  • 9王雷,林亚平.DNA计算在整数规划问题中的应用[J].电子与信息学报,2005,27(5):814-818. 被引量:10
  • 10费蓉,崔杜武.中国邮递员问题的动态规划算法研究[J].计算机研究与发展,2005,42(2):294-299. 被引量:11

二级参考文献35

  • 1费蓉,崔杜武.不定期决策过程优化模型的算法研究[J].微电子学与计算机,2004,21(6):10-12. 被引量:1
  • 2《现代数学手册》编纂委员会.现代数学手册-计算机数学卷[M].武汉:华中科技大学出版社,2001.409-459.
  • 3《现代应用数学手册》编委会.现代应用数学手册-运筹学与最优化理论卷[M].北京:清华大学出版社,1997.254-266.
  • 4R.E. Bellman, S. E. Dreyfus. Applied Dynamic Programming. Princeton, New Jersey: Princeton University Press, 1962.
  • 5J. A. Bondy, U. S. R. Murty. Graph Theory with Applications. London: The Macmillan Press LTD, 1976.
  • 6R.E. Bellman. Dynamic Programming. Princeton, New Jersey:Princeton University Press, 1957.
  • 7GoldbergDE. Genetic algorithms in optimization and machine learning. New York: Addison-Wesley, 1989.
  • 8C.H. Papadimition, K. Steiglitz. Combinatorial Optimization,Algorithms and Complexity. New Jersey: Printice-Hall, 1982.
  • 9Gao Lin, Xu Jin. DNA solution of vertex cover problem based on sticker model. Chinese Journal of Electronics, 2002, 11(2):280 - 284.
  • 10Bach E, et al.. DNA models and algorithms for NP-complete problems. Journal of Computer and System Sciences, 1998, 57(2):172- 186.

共引文献56

同被引文献40

引证文献7

二级引证文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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