电子学报Issue(11)：2174-2180,7.DOI:10.3969/j.issn.0372-2112.2013.11.010
基于自组装的N皇后问题DNA计算算法
An Algorithm in Tile Assembly Model for N Queen Problem
摘要
Abstract
DNA computing employs molecule manipulation to solve NP complete problems that can not be solved using tra-ditional Turing machine .With the deep studying of DNA computing ,we found that DNA computation suffers from relatively high error rates .How to decrease error rates has become an important part of DNA computing .This paper present DNA self-assembly model which decreases error rates through decreasing experiment operations .A new N Queen problem algorithm based on the self assembly model is proposed .The proposed algorithm needs O ( n2 ) types of tiles and the complexity of experiment operations is O (1 ) .Obviously ,this algorithm significantly reduces the complexity of the experiment ,thus improving the accuracy of experimen-tal results .关键词
DNA计算/自组装模型/N皇后问题/tile模型Key words
DNA-based computing/DNA self-assembly model/N queen problem/tile model分类
信息技术与安全科学引用本文复制引用
吴帆,李肯立..基于自组装的N皇后问题DNA计算算法[J].电子学报,2013,(11):2174-2180,7.基金项目
国家自然科学基金（No ．90715029，No ．61070057）；湖南省科技计划 （）
