CAJ | 학술논문

介绍了最大团和最大权团的概念和国内外学者运用DNA计算解决最大团的研究成果；结合前人运用质粒、二进制、粘贴模型等方式进行DNA计算操作的原理，设计了新的用于解决最大权团问题的算法步骤，大大提高了算法效率，实现了最大团和最大权团的同步求解，对市场分析、方案选择等领域有一定的意义。
개소료최대단화최대권단적개념화국내외학자운용DNA계산해결최대단적연구성과；결합전인운용질립、이진제、점첩모형등방식진행DNA계산조작적원리，설계료신적용우해결최대권단문제적산법보취，대대제고료산법효솔，실현료최대단화최대권단적동보구해，대시장분석、방안선택등영역유일정적의의。
The concept of maximum groups , maximum weights groups and the research achievement of the maxi-mum 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 .