This article first introduces the basic idea of DNA computation, then presents DNA computing method for solving NP-complete problems.
本文主要介绍了DNA计算的基本思想及解决NP完全问题的DNA计算方法。
On one hand, the vast parallelism inherent in DNA computation brings new challenges to modern cryptography, which is based on hard mathematic problems.
一方面，DNA计算固有的超大规模并行性给安全性依赖于数学困难问题的现代密码学带来了新的挑战。
Algorithm analyses show that the new proposed algorithm based on DNA computation has such good characteristics as simple encoding and low fault rate etc.
算法分析表明，新提出的基于DNA计算的求解算法具有编码简单和错误率低等特点。
DNA computing is a new computation method with simulating molecular biology structure of DNA and by means of molecular biology technology.
DNA计算是一种模拟生物分子DNA的结构并借助于分子生物技术进行计算的新方法。
Over the past few years, some insightful researchers have bridged the gap between the biological computing theory and actual DNA-based computation.
在过去几年里，一些富有卓见的研究人员已经衔接了生物计算和实际的DNA计算之间的间隙。
DNA computing is a new method for computation using the technology in molecular biology.
dna计算是应用分子生物技术进行计算的新方法。
Because of its highly parallel computation, the investigators use DNA molecular automaton to simulate the electronic computer.
由于DNA计算具有高度的并行性，因此，研究者也把目光投向了用DNA分子自动机来模拟电子计算机。
Directed by that idea, we developed four DNA-base Computation model about basic Algebra operation.
在这一基础思想的指导下，本文在四个基础的代数运算的DNA运算模式方面作了探讨。
Directed by that idea, we developed four DNA-base Computation model about basic Algebra operation.
在这一基础思想的指导下，本文在四个基础的代数运算的DNA运算模式方面作了探讨。
应用推荐