Running dynamic programming algorithms on a DNA computer
Running dynamic programming algorithms on a DNA computer
复制标题
在 DNA 计算机上运行动态规划算法
DOI：
--
复制
发表时间：
1996
期刊：
影响因子：
--
通讯作者：
D. Boneh
中科院分区：
文献类型：
--
作者：
E. Baum;D. Boneh
在本文中，我们表明，DNA计算机是特别有用的运行算法是基于动态规划。这类算法利用了DNA计算机的大存储容量。我们提出的算法，用于解决某些情况下的背包问题，使用动态规划方法。与DNA计算机的其他算法不同，动态编程是用于解决传统计算机上（较小）问题的相同算法。
In this paper we show that DNA computers are especially useful for running algorithms which are based on dynamic programming. This class of algorithms takes advantage of the large memory capacity of a DNA computer. We present algorithms for solving certain instances of the knapsack problem using a dynamic programming approach. Unlike other algorithmss1, 12] for DNA computers , which are brute force, dynamic programming is the same algorithm one would use to solve (smaller) problems on a conventional computer.