首页 | 官方网站   微博 | 高级检索  
     

基于改进蚁群算法的多序列比对
引用本文:彭东海,骆嘉伟,袁辉勇.基于改进蚁群算法的多序列比对[J].计算机工程与应用,2009,45(33):114-116.
作者姓名:彭东海  骆嘉伟  袁辉勇
作者单位:1. 湖南人文科技学院,计算机系,湖南娄底,417000
2. 湖南大学,计算机与通信学院,长沙,410082
基金项目:湖南省自然科学基金,湖南省教育厅科学研究项目,湖南省重点学科建设基金 
摘    要:提出一种基于改进蚁群算法的多序列比对方法。该算法改变了信息素的更新方式、字符的选择方法、蚂蚁在蚁巢和食物之间往返搜索以及随机分配蚂蚁开始序列等。实验结果表明,改进后的算法不仅有效地克服了基本蚁群多序列比对算法中的停滞现象,而且即使在运行的后期,仍然能以极大的概率搜索较好解。

关 键 词:蚁群算法  多序列比对  信息素
收稿时间:2008-12-8
修稿时间:2009-2-18  

Multiple sequence alignment based on improved ant colony algorithm
PENG Dong-hai,LUO Jia-wei,YUAN Hui-yong.Multiple sequence alignment based on improved ant colony algorithm[J].Computer Engineering and Applications,2009,45(33):114-116.
Authors:PENG Dong-hai  LUO Jia-wei  YUAN Hui-yong
Affiliation: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
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 stagna-tion 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.
Keywords:ant colony algorithm  multiple sequence alignment  pheromone
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号