|
|||||
|
|
| 基于粘贴和删除系统求解最小权生成树的DNA算法 | |
| 引用本文： | 董敏,汤建钢. 基于粘贴和删除系统求解最小权生成树的DNA算法[J]. 陇东学院学报(社会科学版), 2011, 0(6) |
| 作者姓名： | 董敏 汤建钢 |
| 作者单位： | 伊犁师范学院数学与统计学院; |
| 基金项目： | 新疆维吾尔自治区自然科学基金资助项目(2011211AD51); 伊梨师范学院2011年度研究生课题资助项目(2011YNYJS007) |
| 摘 要： | 最小权生成树是一类典型的NP完全问题.粘贴和删除模型是DNA计算的两个基本计算模型.利用粘贴和删除模型给出求解最小权生成树问题的DNA算法. |
| 关 键 词： | DNA计算 粘贴模型 删除模型 最小权生成树 |
The DNA Algorithm of Solving Minimum Spanning Tree Problem Based On Sticker System and Delete System |
|
| DONG Min,TANG Jian-gang. The DNA Algorithm of Solving Minimum Spanning Tree Problem Based On Sticker System and Delete System[J]. Journal of Longdong University(Social Science Edition), 2011, 0(6) | |
| Authors: | DONG Min TANG Jian-gang |
| Affiliation: | DONG Min,TANG Jian-gang(College of Mathematics and Statistics,Ili Normal University,Yining 835000,Xinjiang,China) |
| Abstract: | Minimum Spanning Tree is a NP-hard problem.Sticker system and delete system are two basic kinds of DNA computing models.This paper proposes to give a DNA algorithm of Minimum Spanning Tree using Sticker System and Delete System. |
| Keywords: | DNA computing Sticker System Delete System Minimum Spanning Tree |
| 本文献已被 CNKI 等数据库收录！ | |