首页> 外文会议>Algorithms and architectures for parallel processing >Fast Parallel Molecular Solution for DNA-Based Computing: The 0-1 Knapsack Problem
【24h】

Fast Parallel Molecular Solution for DNA-Based Computing: The 0-1 Knapsack Problem

机译:基于DNA的计算的快速并行分子解决方案:0-1背包问题

获取原文
获取原文并翻译 | 示例

摘要

It is shown first by Adleman that deoxyribonucleic acid (DNA) strand could be employed towards calculating solution to an instance of the NP-complete Hamiltonian Path Problem (HPP). Lipton also demonstrated that Adleman's techniques could be used to solve the satisfiability (SAT) problem. In this paper, it is demonstrated how the DNA operations presented by Adleman and Lipton can be used to develop the DNA-based algorithm for solving the 0-1 Knapsack Problem.
机译:Adleman首先表明,脱氧核糖核酸(DNA)链可用于计算NP完全汉密尔顿路径问题(HPP)实例的解。 Lipton还证明了Adleman的技术可用于解决可满足性(SAT)问题。在本文中,演示了如何使用Adleman和Lipton提出的DNA操作来开发基于DNA的算法来解决0-1背包问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号