期刊文献+

基于多策略人工蜂群的多序列比对算法 被引量:1

Multiple sequence alignment algorithm based on multi-strategy artificial bee colony
原文传递
导出
摘要 多序列比对是生物信息学中最重要和最具挑战性的任务之一.基于多序列比对是NP完全组合优化问题,引入Tent混沌初始化种群策略、不同蜂种的邻域搜索策略和锦标赛选择策略等,提出一种基于多策略人工蜂群的多序列比对算法.该算法应用Tent混沌初始化种群策略以使初始个体多样化并获取较好初始解;针对不同蜂种的特性设计不同的邻域搜索策略以平衡算法的全局探索和局部开发能力.同时引入序列比对的蜜源编码方法以适应多序列比对的离散性.实验结果表明,所提出算法的鲁棒性较强,能获取较好的比对性能和生物特性. Multiple sequence alignment(MSA), known as NP-complete combinatorial optimization problem, is one of the most important and challenging tasks in bioinformatics. A multi-strategy artificial bee colony(MS-ABC) algorithm is proposed for MSA, which is composed of multiple strategies, such as the Tent chaotic initialization population strategy,different neighborhood search strategies and tournament selection strategy. In the MSA-ABC algorithm, the Tent chaotic initialization population strategy is presented to diversify the initial individuals and to obtain good initial solutions. Then,the different neighborhood search strategies for different bee species are designed to balance the global exploration and the local exploitation. Moreover, the food source encoding method is used to adapt discreteness of MSA. The experimental results demonstrate that the proposed algorithm is more robust and can obtain better alignment quality and biological characteristics.
作者 匡芳君 张思扬 刘传才 KUANG Fang-jun;ZHANG Si-yang;LIU Chuan-cai(School of Information Engineering,Wenzhou Business College,Wenzhou 325035,China;School of Computer Science and Engineering,Nanjing University of Science and Technology,Nanjing 210094,China)
出处 《控制与决策》 EI CSCD 北大核心 2018年第11期1990-1996,共7页 Control and Decision
基金 国家自然科学基金项目(61373063 61233011 61402227)
关键词 人工蜂群算法 多策略 Tent混沌初始化 邻域搜索 多序列比对 artificial bee colony multi-strategy Tent chaotic initialization neighborhood search multiple sequence alignment
  • 相关文献

参考文献2

二级参考文献39

  • 1单梁,强浩,李军,王执铨.基于Tent映射的混沌优化算法[J].控制与决策,2005,20(2):179-182. 被引量:192
  • 2Karaboga D. An idea based on honey bee swarm for numerical optimization[R]. Kayseri: Erciyes University, 2005.
  • 3Akay B. Performance analysis of artificial bee colony algorithm on numerical optimization problems[D]. Kayseri: Graduate School of Natural and Applied Sciences, Erciyes University, 2009.
  • 4Akay B, Karaboga D. A modified artificial bee colony algorithm for real-parameter optimization[J]. Information Sciences, 2012, 192(6): 120-142.
  • 5Zhu G P, Sam K. Gbestguided artificial bee colony algorithm for numerical function optimization[J]. Applied Mathematics and Computation, 2010, 217(7): 3166-3173.
  • 6Alatas B. Chaotic bee colony algorithms for global numerical optimization[J]. Expert Systems with Applications, 2010, 37(8): 5682-5687.
  • 7Kennedy J, Eberhart R C. Particle swarm optimization[C]. Proc of IEEE Int Conf on Neural Networks. Piscataway, 1995: 1942-1948.
  • 8Jia D L, Zheng G X, Qu B Y, et al. A hybrid particle swarm optimization algorithm for high-dimensional problems[J]. Computers and Industrial Engineering, 2011, 61(4): 1117- 1122.
  • 9Shi X H, Li Y W, Li H J, et al. An integrated algorithm based on artificial bee colony and particle swarm optimization[C]. Int Conf on Natural Computation. Yantai: IEEE Press, 2010: 2586-2590.
  • 10El-Abd M. A hybrid ABC-SPSO algorithm for continuous function optimization[C]. IEEE Symposium on Swarm Intelligence(SIS). Pads: IEEE Press, 2011: 1-6.

共引文献36

同被引文献15

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部