粘贴与删除系统求解最短有向路的DNA计算模型  

DNA computing model for shortest directed path problem based on sticker and delete system

作　　者：马芳芳[1] 王淑栋[1] 李涵[2] 薛圣伟[1] 

机构地区：[1]山东科技大学信息科学与工程学院,山东青岛266510 [2]山东科技大学信息系,山东泰安271209

出　　处：《计算机工程与应用》2008年第25期40-42,共3页Computer Engineering and Applications

基　　金：国家自然科学基金No.60503002;中国博士后科学基金No.20060400344~~

摘　　要：最短有向路问题是在一个有向网络中的两个指定顶点之间找出一条具有最小权的有向路,它在工程实践中具有广泛的应用。粘贴系统与删除系统是DNA计算形式模型中的两种基本模型。论文利用粘贴与删除系统的巨大并行性给出了求解图最短有向路问题的DNA计算模型及其实现算法。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.

关 键 词：DNA计算 粘贴系统 删除系统 最短有向路问题 

分 类 号：O22[理学—运筹学与控制论]