Multiple sequence alignment using the Hidden Markov Model trained by an improved quantum-behaved particle swarm optimization

被引:48
作者
Sun, Jun [1 ]
Wu, Xiaojun
Fang, Wei
Ding, Yangrui
Long, Haixia
Xu, Webo
机构
[1] Jiangnan Univ, Dept Comp Sci & Technol, Wuxi 214122, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Multiple sequence alignment; Hidden Markov Model; Parameter optimization; Quantum-behaved particle swarm optimization; Population diversity; ALGORITHM; TIME; ACO; PARAMETERS; VARIANT; SYSTEM; ONLINE; QPSO;
D O I
10.1016/j.ins.2010.11.014
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multiple sequence alignment (MSA) is an NP-complete and important problem in bioinformatics. For MSA, Hidden Markov Models (HMMs) are known to be powerful tools. However, the training of HMMs is computationally hard so that metaheuristic methods such as simulated annealing (SA), evolutionary algorithms (EAs) and particle swarm optimization (PSO), have been employed to tackle the training problem. In this paper, quantum-behaved particle swarm optimization (QPSO), a variant of PSO, is analyzed mathematically firstly, and then an improved version is proposed to train the HMMs for MSA. The proposed method, called diversity-maintained QPSO (DMQPO), is based on the analysis of QPSO and integrates a diversity control strategy into QPSO to enhance the global search ability of the particle swarm. To evaluate the performance of the proposed method, we use DMQPSO, QPSO and other algorithms to train the HMMs for MSA on three benchmark datasets. The experiment results show that the HMMs trained with DMQPSO and QPSO yield better alignments for the benchmark datasets than other most commonly used HMM training methods such as Baum-Welch and PSO. (C) 2010 Elsevier Inc. All rights reserved.
引用
收藏
页码:93 / 114
页数:22
相关论文
共 70 条
[1]  
Angeline P. J., 1998, Evolutionary Programming VII. 7th International Conference, EP98. Proceedings, P601, DOI 10.1007/BFb0040811
[2]  
[Anonymous], 2001, BIOINFORMATICS
[3]   Swarm-based translation-invariant morphological prediction method for financial time series forecasting [J].
Araujo, Ricardo de A. .
INFORMATION SCIENCES, 2010, 180 (24) :4784-4805
[4]   HIDDEN MARKOV-MODELS OF BIOLOGICAL PRIMARY SEQUENCE INFORMATION [J].
BALDI, P ;
CHAUVIN, Y ;
HUNKAPILLER, T ;
MCCLURE, MA .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1994, 91 (03) :1059-1063
[5]   A MAXIMIZATION TECHNIQUE OCCURRING IN STATISTICAL ANALYSIS OF PROBABILISTIC FUNCTIONS OF MARKOV CHAINS [J].
BAUM, LE ;
PETRIE, T ;
SOULES, G ;
WEISS, N .
ANNALS OF MATHEMATICAL STATISTICS, 1970, 41 (01) :164-&
[6]   Optimizing the codon usage of synthetic gene with QPSO algorithm [J].
Cai, Yujie ;
Sun, Jun ;
Wang, Jie ;
Ding, Yanrui ;
Tian, Na ;
Liao, Xiangru ;
Xu, Wenbo .
JOURNAL OF THEORETICAL BIOLOGY, 2008, 254 (01) :123-127
[7]  
Chellapilla K., 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), P445, DOI 10.1109/CEC.1999.781958
[8]  
Chen W, 2008, LECT NOTES ARTIF INT, V5027, P388, DOI 10.1007/978-3-540-69052-8_41
[9]   Multiobjective constructive heuristics for the 1/3 variant of the time and space assembly line balancing problem: ACO and random greedy search [J].
Chica, Manuel ;
Cordon, Oscar ;
Damas, Sergio ;
Bautista, Joaquin .
INFORMATION SCIENCES, 2010, 180 (18) :3465-3487
[10]   The particle swarm - Explosion, stability, and convergence in a multidimensional complex space [J].
Clerc, M ;
Kennedy, J .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (01) :58-73