期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

应用DNA计算解决最大团问题 被引量：1

Using DNA Computing to Solve Max Clique Problem
下载PDF
导出
摘要 DNA计算是应用分子生物技术进行计算的新方法。具有高度并行性、大容量、低能耗的特点。开创了以生物技术为工具解决复杂问题的新纪元,为解决NP完全问题开辟了一条新途径。本文主要介绍了DNA计算的基本思想及解决NP完全问题的DNA计算方法。 DNA algorithm is a new method for computation using the technology in molecular biology. The characteristic of this computation is its powerful ability in parallelism, its huge storage and high energy efficiency. Therefore, this method, which originated from the tool of biology technology, is believed to have launched a new episode for solving complexity problems, especially for NP-complete problem. This article first introduces the basic idea of DNA computation, then presents DNA computing method for solving NP-complete problems.
作者 李涛
机构地区 太原理工大学信息工程学院
出处 《电力学报》 2006年第3期297-300,共4页 Journal of Electric Power
关键词 NP完全问题 DNA计算 最大团问题 NP-complete problem DNA computing max clique problem
分类号 TP18 [自动化与计算机技术—控制理论与控制工程]
  • 相关文献

参考文献15

  • 1M.R.加里,D.S.约翰逊.计算机和难解性[M].北京:科学出版社,1990:85-96.
  • 2Holland J H.Adaptation in natural and artificial system:An Introduction Analysis with Application to Biology[A]//Control and Artificial Intelligence[M].London:The University of Michigan press,1975:82-129.
  • 3Adleman L M.Molecular computation of solutions to combinatorial problems[J].Science,1994,226:1021-1024.
  • 4Lipton R J.DNA solution of hard computational problems[J].Science,1995,268(5210):542-545.
  • 5GAOLin,YANGXiao,LIUWenbin,XUJin.A DNA based model for addition computation[J].Progress in Natural Science:Materials International,2004,14(8):705-709. 被引量：4
  • 6Roweis,Sam,Winfree Erik et al.A sticker based model for DNA computation[J].Journal of Computational Biology,1998,5(4):615-629.
  • 7Roweis S,Winfree E.On the reduction off errors in DNA computation[J].Journal of Computational Biology,1999,6(1):65-75.
  • 8许进,张雷.DNA计算机原理、进展及难点(Ⅰ):生物计算系统及其在图论中的应用[J].计算机学报,2003,26(1):1-11. 被引量：48
  • 9Rozen D E,Lipton R J.Molecular Computing:Does DNA Compute?[J].Current Biology,1996,6(3):254-257.
  • 10PANLinqiang,LIUGuangwu,XUJin,LIUYachun.Solid phase based DNA solution of the coloring problem[J].Progress in Natural Science:Materials International,2004,14(5):459-462. 被引量：7

二级参考文献25

  • 1[1]Adleman,L.M.Molecular computation of solutions to combinatorial problems.Science,1994,266:1021.
  • 2[2]Lipton,R.J.DNA solutions of hard computational problems.Science,1995,268:542.
  • 3[3]Ouyang,Q.et al.DNA solution of the maximal clique problem.Science,1997,278:446.
  • 4[4]Liu,Q.et al.DNA computing on surfaces.Nature,2000,403:175.
  • 5[5]Wu,H.An improved surface-based method for DNA computation.Biosystem,2001,59:1.
  • 6[6]Benenson,Y.et al.Programmable and autonomous computing machine made of biomolecules.Nature,2001,414:430.
  • 7[7]Garey,M.R.et al.Computers and Intractability:A Guide to the Theory of NP-completeness.San Francisco:W.H.Freeman and Company,1979,191.
  • 8[8]Liu,Y.C.et al.DNA solution of a graph coloring problem.J.Chem.Inf.Comput.Sci.,2002,42(3):524.
  • 9[1]Adleman, L. M. Molecular computation of solutions to combinatorial problems. Science, 1994, 266(11): 1021.
  • 10[2]Lipton, R. J. DNA solution of hard computational problem. Science, 1995, 268(4): 542.

共引文献132

同被引文献6

引证文献1

二级引证文献1

电力学报
2006年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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