首都师范大学学报（自然科学版）2013，Vol.34Issue(1)：7-12,6.
图的最小顶点覆盖的粘贴DNA计算模型
Minimum Vertex Cover Problem of Graph Based on Sticker Model of DNA Computing
摘要
Abstract
In this paper, we discussed the classical model and all the information sticker model of DNA computing. Based on this,we proposed a new project of sticker model for DNA computing to solve the minimum vertex cover problem which based on the idea of taking bio-technology to fulfill the parallelism. This will combined the solution of mathematics problems with the biological technology.关键词
DNA计算/粘贴模型/最小顶点覆盖问题Key words
DNA computing/sticker model/minimum vertex cover problem分类
信息技术与安全科学引用本文复制引用
聂晓艳,耿俊,汤建钢..图的最小顶点覆盖的粘贴DNA计算模型[J].首都师范大学学报（自然科学版）,2013,34(1):7-12,6.基金项目
新疆维吾尔自治区自然科学基金资助项目(2011211A051) （2011211A051）
伊犁师范学院2012年度研究生资助课题(2012YJS011) （2012YJS011）
喀什师范学院青年专项资助课题(122448). （122448）
