| 图的最小顶点覆盖的粘贴DNA计算模型 |
| |
| 引用本文： | 聂晓艳,耿俊,汤建钢.图的最小顶点覆盖的粘贴DNA计算模型[J].首都师范大学学报(自然科学版),2013,34(1):7-12. |
| |
| 作者姓名： | 聂晓艳 耿俊 汤建钢 |
| |
| 作者单位： | 1. 伊犁师范学院数学与统计学院,新疆伊宁,835000
2. 喀什师范学院数学系,新疆喀什,844006 |
| |
| 基金项目： | 新疆维吾尔自治区自然科学基金资助项目，伊犁师范学院2012年度研究生资助课题，喀什师范学院青年专项资助课题 |
| |
| 摘 要： | 本文在对经典粘贴模型以及全信息化的粘贴DNA计算模型的基本方法进行充分讨论的基础上,提出一种用粘贴DNA计算模型解决图的最小顶点覆盖问题的新方案,将数学问题的求解同并行生物操作有效结合.
|
| 关 键 词： | DNA计算 粘贴模型 最小顶点覆盖问题 |
Minimum Vertex Cover Problem of Graph Based on Sticker Model of DNA Computing |
| |
| Nie Xiaoyan
,
Geng Jun
,
Tang Jiangang.Minimum Vertex Cover Problem of Graph Based on Sticker Model of DNA Computing[J].Journal of Capital Normal University(Natural Science Edition),2013,34(1):7-12. |
| |
| Authors: | Nie Xiaoyan Geng Jun Tang Jiangang |
| |
| Institution: | Nie Xiaoyan Geng Jun Tang Jiangang ( 1. School of Mathematics and Statistics, Ili Normal University, Yining 835000 ; 2. Department of Mathematics,Kashi Normal University,Kashi 844006) |
| |
| 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 |
| |
| Keywords: | DNA computing sticker model minimum vertex cover problem |
| 本文献已被 维普 万方数据 等数据库收录！ |
