计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (35): 166-168.

• 数据库与信息处理 • 上一篇    下一篇

基于信息素智能更新的蚁群双序列比对算法

彭东海1,2,骆嘉伟2,陈 斐2   

  1. 1.湖南人文科技学院 计算机系,湖南 娄底 417000
    2.湖南大学 计算机与通信学院,长沙 410082
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-12-11 发布日期:2007-12-11
  • 通讯作者: 彭东海

Ant colony algorithm based on intelligent altering pheromone for pairwise sequence alignment

PENG Dong-hai1,2,LUO Jia-wei2,CHEN Fei2   

  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:1900-01-01 Revised:1900-01-01 Online:2007-12-11 Published:2007-12-11
  • Contact: PENG Dong-hai

摘要: 序列比对算法是生物信息学中重要的研究方向之一。提出了一种基于信息素智能更新的蚁群双序列比队算法,该算法利用历史最优信息来更新信息素,避免出现早熟现象,加速算法的后期收敛。实验表明该方法是有效性和可行的。

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

Abstract: Sequence alignment algorithm is an important research direction in Bioinformatics.This paper proposes an ant colony algorithm based on Intelligent altering pheromone for pairwise sequence alignment.This new algorithm uses the history optimization information to update pheromone,avoids prematurity and accelerates the convergence of algorithm in later period.The results demonstrate that this new approach is reasonable and efficient.

Key words: ant colony algorithm, sequence alignment, pheromone