| 粘贴与删除系统求解最短有向路的DNA计算模型 |
| |
| 引用本文： | 马芳芳,王淑栋,李涵,薛圣伟.粘贴与删除系统求解最短有向路的DNA计算模型[J].计算机工程与应用,2008,44(25):40-42. |
| |
| 作者姓名： | 马芳芳 王淑栋 李涵 薛圣伟 |
| |
| 作者单位： | 1. 山东科技大学,信息科学与工程学院,山东,青岛,266510
2. 山东科技大学,信息系,山东,泰安,271209 |
| |
| 基金项目： | 国家自然科学基金，中国博士后科学基金 |
| |
| 摘 要： | 最短有向路问题是在一个有向网络中的两个指定顶点之间找出一条具有最小权的有向路,它在工程实践中具有广泛的应用。粘贴系统与删除系统是DNA计算形式模型中的两种基本模型。论文利用粘贴与删除系统的巨大并行性给出了求解图最短有向路问题的DNA计算模型及其实现算法。
|
| 关 键 词： | DNA计算 粘贴系统 删除系统 最短有向路问题 |
| 收稿时间： | 2007-12-6 |
| 修稿时间： | 2008-2-27
|
DNA computing model for shortest directed path problem based on sticker and delete system |
| |
| MA Fang-fang,WANG Shu-dong,LI Han,XUE Sheng-wei.DNA computing model for shortest directed path problem based on sticker and delete system[J].Computer Engineering and Applications,2008,44(25):40-42. |
| |
| Authors: | MA Fang-fang WANG Shu-dong LI Han XUE Sheng-wei |
| |
| Affiliation: | 1.College of Information Science and Engineering，Shandong University of Science and Technology，Qingdao，Shandong 266510，China 2.College of Information，Shandong University of Science and Technology，Taian，Shandong 271209，China |
| |
| Abstract: | Shortest directed path problem is finding a directed path with minimum weight in two pointed vertex of a directed network.It has extensive application in engineering practice.Sticker system and delete system are two kinds of basic models in DNA computing form model.This paper proposes DNA computing model and biochemical procedures of graph shortest directed path problem using high parallelism of sticker system and delete system. |
| |
| Keywords: | DNA computing sticker system delete system shortest directed path problem |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
