This article first introduces the basic idea of DNAcomputation, then presents DNA computing method for solving NP-complete problems.
本文主要介绍了DNA计算的基本思想及解决NP完全问题的DNA计算方法。
2
On one hand, the vast parallelism inherent in DNAcomputation brings new challenges to modern cryptography, which is based on hard mathematic problems.
一方面，DNA计算固有的超大规模并行性给安全性依赖于数学困难问题的现代密码学带来了新的挑战。
3
Algorithm analyses show that the new proposed algorithm based on DNAcomputation has such good characteristics as simple encoding and low fault rate etc.