论文部分内容阅读
电子计算机的发展给人类社会进步带来了极大的推动作用,但是随着电子计算机制造工艺趋于极限,人们迫切需要找到一种新的计算体系来满足日益增长的计算需求。DNA计算因其超强的信息存储、大规模的并行计算能力和超低的能耗而受到了广泛的关注。自1994年Adleman博士在实验室利用DNA完成了一个6顶点哈密尔顿路求解问题开始,各种计算模型纷纷涌现。本文首先对DNA计算的基本原理和实验操作手段进行了简单的介绍,然后对DNA相关的理论进行了阐述,包括DNA计算中序列编码设计的理论、DNA计算模型复杂度分析与通用计算能力的证明;在此基础上,对突破性的DNA计算模型进行了概括,进而根据实验操作的具体手段将所有已知模型进行了分类,按照类别进行了综述,并随后挑选了该类别中经典的模型进行更为直观的分析。更进一步,在文章的最后,结合笔者的工作对DNA计算领域的前景进行了展望。
The development of electronic computer has brought a great impetus to the progress of human society. However, as the manufacturing process of electronic computer approaches the limit, there is an urgent need to find a new computing system to meet the increasing demand for computing. DNA computing has received widespread attention due to its powerful information storage, large-scale parallel computing power and ultra-low power consumption. Since 1994 Dr. Adleman began a 6-vertex Hamiltonian solution using DNA in the lab, a variety of computational models have emerged. This paper first introduces the basic principles of DNA computing and experimental methods of operation briefly, and then describes the DNA-related theory, including DNA coding sequence coding design theory, DNA computing model complexity analysis and proof of general computing power Based on this, the disruptive DNA computing models are summarized, and then all the known models are classified according to the experimental operation, which are classified according to categories, and then the classic models in this category are selected More intuitive analysis. Further, at the end of the article, the prospect of the field of DNA computing is prospected with the author’s work.