期刊文献+

基于粘贴DNA芯片模型的八皇后问题算法 被引量:7

Algorithm of sticker DNA chip model on Eight Queens problem
下载PDF
导出
摘要 提出了粘贴 DNA 芯片模型,该模型综合了粘贴模型的筛选功能和 DNA 芯片模型的检测功能.利用这两个特点设计了基于粘贴 DNA 芯片模型的求解八皇后问题全部解的 DNA 算法.该算法首先产生所有可能的解,再分别按照行要求,列要求和对角线要求逐步筛选出八皇后问题的全部解.利用 DNA 芯片检测出实验结果,然后对每个实验步骤分析了算法的生化实现过程并得到了八皇后问题的全部解.最后讨论了算法的复杂性及其优势. In this paper, a model of sticker DNA chip is brought forward. This model combines the filter function of sticker model and the check function of DNA chip model. And using this two characteristics, an algorithm of sticker DNA chip model to obtain all solutions of Eight Queens problem is designed. In the algorithm, all possible solutions are gotten. Then all solutions of Eight Queens problem are obtained gradually, according to row restriction, line restriction and diagonal restriction, respectively. The experiment result is checked by DNA chip. Biochemistry realizing process of each experiment step of this algorithm is analyzed, and all solutions of Eight Queens problem are obtained. Fially, complexity and predominance of the DNA algorithm are discussed.
出处 《系统工程学报》 CSCD 北大核心 2008年第3期372-376,共5页 Journal of Systems Engineering
基金 国家自然科学基金资助项目(60403002) 湖北省自然科学基金资助项目(2007ABA407 2005ABA233) 湖北省教学研究资助项目(20040248) 浙江省自然科学基金资助项目(ZJNSF-Y105654)
关键词 八皇后问题 粘贴DNA芯片模型 DNA编码 分离实验 Eight Queens problem model of sticker DNA chip DNA encoding separate experiment
  • 相关文献

参考文献7

二级参考文献21

  • 1周康,同小军,许进.路径排序问题基于表面的DNA算法[J].华中科技大学学报(自然科学版),2005,33(8):100-103. 被引量:16
  • 2周康,王子成,许进.最大流问题的DNA计算两阶段法[J].华中科技大学学报(自然科学版),2005,33(8):104-107. 被引量:11
  • 3周康,许进.最小顶点覆盖问题的闭环DNA算法[J].计算机工程与应用,2006,42(20):7-9. 被引量:28
  • 4周康,王延峰,刘文斌,许进.基于闭环DNA的边着色问题DNA算法[J].华中科技大学学报(自然科学版),2006,34(9):25-28. 被引量:14
  • 5Adleman L M.Molecular computation of solutions to combinatorial problems[J].Science,1994,266(11),1021-1024.
  • 6Zhou Kang,Tong Xiaojun,Xu Jin.An algorithm of sticker DNA chip model on making spanning tree problem[C]// Proceedings of the Fifth International Conference on Machine Learning and Cybernetics,2006:4287-4292.
  • 7Lipton R J.DNA solution of hard computational problem[J].Science,1995,268(28),542-545.
  • 8Zhou Kang,Gao Zunhai,Xu Jin.An algorithm of DNA computing on 0-1 planning problem[J].Advances in Systems Science and Applications,2005,5(4):587-593
  • 9Bondy J A,Murty U S R.Graph theory with applications[M].London:The Macmillan Press LTD,1976.
  • 10ZHOU K,TONG XJ,XU J.An algorithm of sticker DNA chip model on making spanning tree problem[A].Proceedings of the Fifth International Conference on Machine Learning and Cybernetics,Dalian:IEEE Systems Man and Cybernetics Society[C].2006.4287-4292.

共引文献73

同被引文献63

引证文献7

二级引证文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部