作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (6): 184-186. doi: 10.3969/j.issn.1000-3428.2011.06.063

• 人工智能及识别技术 • 上一篇    下一篇

基于SWGPSO算法的多序列比对

徐小俊 a,雷秀娟 a,郭 玲 b   

  1. (陕西师范大学 a. 计算机科学学院;b. 生命科学学院,西安 710062)
  • 出版日期:2011-03-20 发布日期:2011-03-29
  • 作者简介:徐小俊(1985-),女,硕士研究生,主研方向:智能优化算法,生物信息计算;雷秀娟,副教授、博士后;郭 玲,实验师
  • 基金资助:
    中央高校基本科研业务专项基金资助项目(GK2009020 16);2010年度陕西省科技计划基金资助项目(2010JQ8034)

Multiple Sequence Alignment Based on SWGPSO Algorithm

XU Xiao-jun a, LEI Xiu-juan a, GUO Ling b   

  1. (a. School of Computer Science; b. College of Life Sciences, Shaanxi Normal University, Xi’an 710062, China)
  • Online:2011-03-20 Published:2011-03-29

摘要: 针对粒子群优化(PSO)易陷入局部最优、收敛速度慢的现象,提出一种新的惯性权重取值方法——分段取值惯性权重(SW)方法。该方法在算法前期增加粒子多样性,后期加速算法收敛。针对PSO仅使用2个最优值寻优的问题,引入第3个最优值GB,将SW与GB结合,改进PSO的进化方程。实验结果表明,该算法解决多序列比对问题时,可以有效地避免算法早熟,并提高解的精度。

关键词: 粒子群优化算法, 分段取值惯性权重, SW与GB的结合

Abstract: In this paper, a new method of getting inertia weight, Subsection Weight(SW) is proposed in order to solve the Particle Swarm Optimization(PSO) disadvantages which are likely to fall into local optimum and slow converge. The diversity of swarm increases at the prophase and the convergence is accelerated in the later period. Meanwhile, the combination of SW and GB can improve the evolutionary equation of PSO and makes it perform better. Experimental result shows that the algorithm can effectively avoid converging too early and increase the precision in solving multiple sequence alignment.

Key words: Particle Swarm Optimization(PSO) algorithm, Subsection Weight(SW), combination of SW and GB

中图分类号: