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计算的求解算法具有编码简单和错误率低等特点。
应用推荐