首页 | 本学科首页   官方微博 | 高级检索  
     

自适应蚁群算法在序列比对中的应用
引用本文:梁栋,霍红卫.自适应蚁群算法在序列比对中的应用[J].计算机仿真,2005,22(1):100-102,106.
作者姓名:梁栋  霍红卫
作者单位:西安电子科技大学计算机学院,陕西,西安,710071
摘    要:序列比对是生物信息学的重要研究工具。蚁群算法是一种新型的模拟进化算法,并被成功地应用于旅行商问题(TSP)等组合优化问题中。该文将蚁群算法应用于序列比对,并提出基于自适应调整信息素的改进算法。仿真结果表明这种新的比对算法是有效的,而它的改进算法的效果更为理想。

关 键 词:蚁群算法  序列比对  信息素
文章编号:1006-9348(2005)01-0100-03

An Adaptive Ant Colony Optimization Algorithm and Its Application to Sequence Alignment
LIANG Dong,HUO Hong-wei.An Adaptive Ant Colony Optimization Algorithm and Its Application to Sequence Alignment[J].Computer Simulation,2005,22(1):100-102,106.
Authors:LIANG Dong  HUO Hong-wei
Abstract:Sequence alignment is one of the most important tools in bioinformatics research. Ant colony optimization is a novel simulated evolutionary algorithm successfully used in combinatorial optimization problems such as TSP. In this paper, ACO is applied in sequence alignment and improved by adaptive adjusting the pheromone. The simulation results demonstrate that the new approach is efficient and the improved algorithm is more efficient.
Keywords:Ant colony optimization  Sequence alignment  Pheromone
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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