摘要
多序列比对问题是生物信息科学中一个非常重要且具挑战性的课题,并已经被证明属于问题。为了克服以往算法中的求解速度慢的缺点,本文提出了一种基于遗传算法和蚁群算法的算法来求解的新方法,在单独使用遗传算法的基础上再使用蚁群算法来进行局部搜索以便更快速地求得解。实验结果表明,遗传-蚁群算法能有效地求解多序列比对问题。
Multiple sequence alignment ,which have been proved to be a NP-complete problem, is a most important and challenging tasks in computational biology. In order to solve this time-consuming problem, a novel method has been proposed in this paper. It combins the genetic algorithm and the ant colony optimization, in which the ant colony optimization was used to local search. The result has shown that this method has superior performance for the multiple sequence alignment.
出处
《现代计算机》
2007年第2期23-26,共4页
Modern Computer
关键词
多重序列比对
遗传算法
蚁群算法
局部搜索
Multiple Sequence Alignment
Genetic Algorithm
Ant Colony Optimization
Local Search
