DNA计算在求解NP-完全问题的应用  

作　　者：周金凤[1] 

机构地区：[1]安徽理工大学,安徽淮南232001

出　　处：《科技视界》2012年第35期236-238,共3页Science & Technology Vision

摘　　要：基于生化反应的DNA计算模型越来越受到关注。DNA计算的研究已经成为一个热点。本文主要介绍了DNA计算在一些NP-完全问题中的应用。并分析了DNA模型存在的问题。指出未来国内DNA计算研究的重点可以在三个方面:解的检测,降低空间复杂度,生化实验研究。Biomolecular computing is a type of computation in the molecular scale, using biomolecular engineering techniques. Recently, the research of DNA computing ha become a hot spot. The research trend and progress about DNA computing models in NP- completed problem are introduced. The detailed analysis of existing problem in DNA computing models as well as the domestic research of DNA computing is presented, and the future direction is also speculated, including solution of the detection, the reduce of space complexity, biochemical experiment research.

关 键 词：DNA计算 NP-完全问题 最大团 最小顶点覆盖 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]