Application of DNA computing in graph theory
Application of DNA computing in graph theory
复制标题
DOI：
10.1007/s10462-011-9247-5
复制
发表时间：
2012-10
影响因子：
12
通讯作者：
Hossein Eghdami;M. Darehmiraki
中科院分区：
文献类型：
--
作者：
Hossein Eghdami;M. Darehmiraki
虽然DNA计算在研究人员意识到与之相关的一些缺点时被迅速抛弃，但通过分子反应的计算机模拟，它可以通过提供大规模并行性的计算机架构在硅片上实现。本文介绍了几个著名图问题的粘贴算法。提出的算法具有多项式时间复杂度。
Although DNA computing was rapidly discarded when researchers realized some of the drawbacks related to it, but by computer simulation of molecular reaction it may be implemented in silico by computer architectures offering massive parallelism. In this review, we describe sticker algorithm for several famous graph problem. Presented algorithms have polynomial time complexity.