哈尔滨商业大学学报（自然科学版）2023，Vol.39Issue(6)：694-701,8.
旅行商问题的DNA可视化计算模型
DNA visualization computational model for traveling salesman problem
摘要
Abstract
This paper proposed a solution to the traveling salesman problem based on"DNA origami".Used"DNA origami"to fold out a fixed size DNA nanostructure as the DNA origami base,used molecular beacons to represent the cities(i.e.vertices)and paths in the traveling salesman problem,then map the path of the traveling salesman problem to a directed graph,selected the root node to finally map the problem to a directed tree,and anchor the directed tree on the DNA origami base,the shortest DNA long chain passing through each point was reflected by the hybrid chain reaction,which was the optimal solution of the problem.At the same time,the number of molecular beacons labeled with fluorescence was used to detect the path length,so as to realize the visualization of solving the traveling salesman problem.The effectiveness and feasibility of the method were verified by case simulation and simulation experiments.The complexity of the DNA visual computing model was given through analysis.关键词
DNA折纸术/杂交链式反应/旅行商问题/分子信标/DNA计算Key words
DNA origami/hybrid chain reaction/travelers′ problems/molecular beacon/DNA computing分类
信息技术与安全科学引用本文复制引用
张彤彤,杨静,殷志祥,蒋天怿,郑雅雯..旅行商问题的DNA可视化计算模型[J].哈尔滨商业大学学报（自然科学版）,2023,39(6):694-701,8.基金项目
国家自然科学基金(No.62272005),项目名称:DNA反应网络的理论研究与计算模型. （No.62272005）
