关于DNA计算的基本原理与探讨  

An Exploration of the Principles of DNA Computation

作　　者：李人厚[1] 余文[1] 

机构地区：[1]西安交通大学系统工程研究所,西安710049

出　　处：《计算机学报》2001年第9期972-978,共7页Chinese Journal of Computers

摘　　要：该文综述了 DNA计算的原理及其当前发展的动向 .DNA计算虽然刚刚兴起不久 ,但它是一个新的交叉学科和研究领域 ,有不可估量的应用潜力 .文中指出了Since L.M.Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian problem for a simple directed graph, there are many researchers taking steps to study the possibility of DNA computing to be applied to engineering optimization problems. It becomes a new interdiscipline and new research area and has significant application potential. This paper begins with introducing fundamental concepts about DNA computing then sums up some recent theoretical results of DNA computing and indicats the main research issues of the DNA computing and its application fields. Although DNA computing has powerful ability in parallel processing, unfortunately biological manipulation is so difficult that to date, only some simple computations have been carried out in DNA. Much work remains to be done on the containment and correction of errors and also attentions must be paid to the simplification of the manipulation of DNA. The paper points out that simulation methods and algorithms to handle the errors in biological operation are necessary for pushing the DNA computing into practice.

关 键 词：DNA计算 NP完全问题 并行进化算法 分子计算机 

分 类 号：TP384[自动化与计算机技术—计算机系统结构]