• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Mechatronics, Materials, Chemistry and Computer Engineering >Research on DNA Computing Methods of Optimization Problems on Weighted Graph
【24h】

Research on DNA Computing Methods of Optimization Problems on Weighted Graph

机译：加权图中优化问题DNA计算方法研究

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The paper researched the DNA computing method of classical optimization problems on weighted graph, improved the method of Weight-coding that belongs to the original model of DNA, raised some new methods of DNA encoding and DNA computing. Generally speaking, through the Relative length graph design that belongs to an Undirected weighted graph, given DNA coding and DNA computing a new method by Traveling salesman problems and Chinese mail carrier problems that based on the General line graph of an Undirected weighted graph. And the same time, through the Inverse optimal alignment of DNA sequence given the DNA cording and DNA computing a new method. The method based on the Optimal alignment which one of the Minimum spanning tree problems. Thought the Polynomial transformation about the Vertex cover problems that was the way to improve the Polynomial transformation form Vertex cover problem to Hamiltonian path. The new computing method improved the ability to express and deal with figures during DNA computing.
机译：本文研究了加权图中经典优化问题的DNA计算方法，改善了属于DNA原始模型的体重编码方法，提出了一些DNA编码和DNA计算的新方法。一般而言，通过所属于无向加权图的相对长度图设计，给定DNA编码和DNA通过旅行的推销员问题和基于无向加权图的一般线图的邮件载体问题计算新方法。同时，通过逆最佳对准DNA序列给定DNA序列和DNA计算新方法。基于最佳对准的方法，该方法是最小的跨度树问题之一。认为多项式转变关于顶点覆盖问题，这是提高多项式变换形式顶点覆盖哈密顿路径的方法。新的计算方法提高了在DNA计算期间表达和处理数字的能力。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号