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

DNA Pair-Wise Sequence Alignment Based on an Improved Ant Colony Algorithm

作　　者：李方洁[1] 刘希玉[1] 陈洁[1] 

机构地区：[1]山东师范大学管理与经济学院,山东济南250014

出　　处：《南京师大学报（自然科学版）》2010年第4期148-152,共5页Journal of Nanjing Normal University(Natural Science Edition)

基　　金：山东省信息产业发展专项基金(2008R00038)

摘　　要：序列比对是生物信息学中基本的信息处理方法之一.DNA序列比对分为多序列比对和双序列比对两种.本文首先分析了经典蚁群算法在双序列比对中的应用,然后针对经典蚁群算法收敛速度慢和陷入局部最优值等缺点进行改进,最后通过实验证明改进的智能蚁群算法在收敛速度和最优值方面都有较大的改进.Sequence alignment is a basic information processing approach. DNA sequence alignment has multiple sequence alignment and pair-wise sequence alignment. This paper analyzed pair-wise sequence alignment based on standard ant colony algorithm firstly. Secondly, in order to accelerate the convergence and avoid the stagnation, this paper proposed an improved ant colony algorithm. Lastly, it proved that both convergence rate and global optimum have much better results.

关 键 词：蚁群算法 双序列比对 信息素 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]