Solving Multiple Sequence Alignment Based on Ant Colony Algorithm
求解多重序列比对问题的蚁群算法

Multiple sequence alignment is an important and fundamental problem in bioinformatics especially in the analysis of biosequences.A new ant colony algorithm for multiple sequence alignment is presented.In the algorithm,artificial ants progressively select the matching character by the probability according to the pheromone,matching score between the characters and the deviation information of their locations.In addition,by strategies of pheromone updating,the algorithm can prevent local convergence and enhance its ability of optimization.Based on the algorithm,a more efficient algorithm for multiple sequence alignment using ant colony optimization and divide-and-conquer method is presented.Experimental results show that the algorithm can get high quality solution and reduce the running time.