江汉大学学报：自然科学版2012，Vol.40Issue(5)：5-8,4.
基于粘贴系统求解无向图最短路径问题的DNA计算模型
DNA Algorithm for Shortest Path Problem of Undirected Graph Based on Sticker Systems
摘要
Abstract
Proposed a new project of DNA computing model to solve the shortest path prob- lem of fixed start point and end point of undirected graph, In this DNA algorithm,two opposite di- rected edge took place of each side of undirected graph, so changed the undirected graph into di- rected graph, And all paths of fixed start and end point are obtained by taking use of parallelism of sticker systems. Then can take the shortest path by some molecular biology technology, such as probe, eleetrophoresis, and so on. An example is applied to illustrate the feasibility of the DNA algorithm.关键词
DNA计算/粘贴系统/最短路径问题Key words
DNA computing/sticker systems/shortest path problem分类
信息技术与安全科学引用本文复制引用
聂晓艳,耿俊,汤建钢..基于粘贴系统求解无向图最短路径问题的DNA计算模型[J].江汉大学学报：自然科学版,2012,40(5):5-8,4.基金项目
国家自然科学基金资助项目 （）
新疆维吾尔自治区自然科学基金资助项目 （）
伊犁师范学院研究生资助课题 （）
喀什师范学院青年专项课题 （）
