Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (33): 114-116.DOI: 10.3778/j.issn.1002-8331.2009.33.037

• 数据库、信号与信息处理 • Previous Articles     Next Articles

Multiple sequence alignment based on improved ant colony algorithm

PENG Dong-hai1,LUO Jia-wei2,YUAN Hui-yong1   

  1. 1.Department of Computer Science,Hunan Institute of Humanities and Science and Technology,Loudi,Hunan 417000,China
    2.College of Computer and Communication,Hunan University,Changsha 410082,China
  • Received:2008-12-08 Revised:2009-02-18 Online:2009-11-21 Published:2009-11-21
  • Contact: PENG Dong-hai

基于改进蚁群算法的多序列比对

彭东海1,骆嘉伟2,袁辉勇1   

  1. 1.湖南人文科技学院 计算机系,湖南 娄底 417000
    2.湖南大学 计算机与通信学院,长沙 410082
  • 通讯作者: 彭东海

Abstract: In this paper,a multiple sequence alignment is presented based on improved ant colony algorithm.Some changes have done in the algorithm including the renewal mode of the pheromone,the select means of the characters,the search strategy of ants on the trip between ant nest and food,the random distributing of the ants beginning sequence.The results show that stagnation behavior of basic ant colony mutiple sequence alignment algorithm is avoided and a good ability of searching better solution in the last runs of the improved algorithm is achieved.

Key words: ant colony algorithm, multiple sequence alignment, pheromone

摘要: 提出一种基于改进蚁群算法的多序列比对方法。该算法改变了信息素的更新方式、字符的选择方法、蚂蚁在蚁巢和食物之间往返搜索以及随机分配蚂蚁开始序列等。实验结果表明,改进后的算法不仅有效地克服了基本蚁群多序列比对算法中的停滞现象,而且即使在运行的后期,仍然能以极大的概率搜索较好解。

关键词: 蚁群算法, 多序列比对, 信息素

CLC Number: