基于DNA计算的最大权团问题设计  

Design of Maximum Weight Clique Problem Based on DNA Computing

作　　者：张喆[1] 殷志祥[1] 

机构地区：[1]安徽理工大学理学院,安徽淮南232000

出　　处：《安徽理工大学学报（自然科学版）》2015年第1期75-77,共3页Journal of Anhui University of Science and Technology:Natural Science

摘　　要：介绍了最大团和最大权团的概念和国内外学者运用DNA计算解决最大团的研究成果;结合前人运用质粒、二进制、粘贴模型等方式进行DNA计算操作的原理,设计了新的用于解决最大权团问题的算法步骤,大大提高了算法效率,实现了最大团和最大权团的同步求解,对市场分析、方案选择等领域有一定的意义。The concept of maximum groups,maximum weights groups and the research achievement of the maximum groups solving by DNA computing proposed by foreign scholars are presented. According to the principals of DNA computing with plasmids,binary,and pasting model,a new algorithm steps for solving the maximum weight clique problem are designed,which greatly improves efficiency of the algorithm. Simultaneous solving of the maximum groups and the maximum rights groups are realized. It has some significance to market analysis and scheme selection.

关 键 词：DNA计算 质粒 粘贴模型 最大权团 凝胶电泳 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]