Experimental result shows that the algorithm can effectively avoid converging too early and increase the precision in solving multiple sequence alignment.
实验结果表明,该算法解决多序列比对问题时,可以有效地避免算法早熟,并提高解的精度。
参考来源 - 基于SWGPSO算法的多序列比对Multiple Sequence Alignment (MSA) is one of the most important tools in modern biology. The MSA problem is NP-hard; therefore, heuristic approaches are needed to align a large set of data within a reasonable time.
多序列联配(MAS)是现代生物信息学中的重要工具之一,MAS问题是NP-难的,因此需要一些启发式方法在合理的时间内联配大的数据集。
参考来源 - 基于最小生成树的多序列联配算法 in CMultiple sequence alignment is a typical NP-hard problem.
多序列比对问题是典型的NP难问题。
参考来源 - 基于密码子替代矩阵的序列比对·2,447,543篇论文数据，部分数据来源于NoteExpress
以上来源于: WordNet
This thesis mainly focuses on the study of double sequence alignment and multiple sequence alignment based on ant colony algorithm.
本文将蚁群算法引入序列比对，并对基于蚁群算法的双序列比对和多序列比对进行了研究。
Multiple sequence alignment is one of the essential tools of studying bioinformatics and it plays an important role in the evolution analysis and protein structure prediction.
多序列比对是一种重要的生物信息学工具，在生物的进化分析以及蛋白质的结构预测方面有著重要的应用。
Multiple Sequence alignment (MSA) is a typical NP-Complete problem. Star alignment is an effective algorithm for MSA.
多序列比对(msa)是一个典型的NP完全问题，星比对是一种有效的多序列比对算法。
应用推荐