数字技术与应用Issue(1)：216-217,2.
最小连通图问题的DNA表面计算
DNA algorithm for solving the Minimum Connected problem
摘要
Abstract
Now We discuss a method based on DNA surface computing and computer calculation. To solve the NP complete problem. Through designng the database, the chip model design algorithm based on different issues, Calculated response on the surface chip,and calculated through the special y designed software for further calculation, you can directly get the complete solution of the problem. With the previous method of DNA calculation, DNA surface computing can make the DNA computing needing the index time into polynomial time, and low false positive rate. Through software and electronic computer combining, DNA computing can completely play the advantages of paral el computing and computer data processing capacity of the rapid advantage, and heterozygosity to achieve goodresult.关键词
最小连通问题/Adleman-Lipton模型/DNA表面计算Key words
the shortest path problem/Adleman-Lipton model/DNA computing分类
生物科学引用本文复制引用
王兆才..最小连通图问题的DNA表面计算[J].数字技术与应用,2013,(1):216-217,2.基金项目
本文获上海海洋大学博士科研启动基金资助(A-0209-13-0105351) （A-0209-13-0105351）
