Cargando…

ProbPFP: a multiple sequence alignment algorithm combining hidden Markov model optimized by particle swarm optimization with partition function

BACKGROUND: During procedures for conducting multiple sequence alignment, that is so essential to use the substitution score of pairwise alignment. To compute adaptive scores for alignment, researchers usually use Hidden Markov Model or probabilistic consistency methods such as partition function. R...

Descripción completa

Detalles Bibliográficos
Autores principales: Zhan, Qing, Wang, Nan, Jin, Shuilin, Tan, Renjie, Jiang, Qinghua, Wang, Yadong
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2019
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6876095/
https://www.ncbi.nlm.nih.gov/pubmed/31760933
http://dx.doi.org/10.1186/s12859-019-3132-7
_version_ 1783473154270691328
author Zhan, Qing
Wang, Nan
Jin, Shuilin
Tan, Renjie
Jiang, Qinghua
Wang, Yadong
author_facet Zhan, Qing
Wang, Nan
Jin, Shuilin
Tan, Renjie
Jiang, Qinghua
Wang, Yadong
author_sort Zhan, Qing
collection PubMed
description BACKGROUND: During procedures for conducting multiple sequence alignment, that is so essential to use the substitution score of pairwise alignment. To compute adaptive scores for alignment, researchers usually use Hidden Markov Model or probabilistic consistency methods such as partition function. Recent studies show that optimizing the parameters for hidden Markov model, as well as integrating hidden Markov model with partition function can raise the accuracy of alignment. The combination of partition function and optimized HMM, which could further improve the alignment’s accuracy, however, was ignored by these researches. RESULTS: A novel algorithm for MSA called ProbPFP is presented in this paper. It intergrate optimized HMM by particle swarm with partition function. The algorithm of PSO was applied to optimize HMM’s parameters. After that, the posterior probability obtained by the HMM was combined with the one obtained by partition function, and thus to calculate an integrated substitution score for alignment. In order to evaluate the effectiveness of ProbPFP, we compared it with 13 outstanding or classic MSA methods. The results demonstrate that the alignments obtained by ProbPFP got the maximum mean TC scores and mean SP scores on these two benchmark datasets: SABmark and OXBench, and it got the second highest mean TC scores and mean SP scores on the benchmark dataset BAliBASE. ProbPFP is also compared with 4 other outstanding methods, by reconstructing the phylogenetic trees for six protein families extracted from the database TreeFam, based on the alignments obtained by these 5 methods. The result indicates that the reference trees are closer to the phylogenetic trees reconstructed from the alignments obtained by ProbPFP than the other methods. CONCLUSIONS: We propose a new multiple sequence alignment method combining optimized HMM and partition function in this paper. The performance validates this method could make a great improvement of the alignment’s accuracy.
format Online
Article
Text
id pubmed-6876095
institution National Center for Biotechnology Information
language English
publishDate 2019
publisher BioMed Central
record_format MEDLINE/PubMed
spelling pubmed-68760952019-11-29 ProbPFP: a multiple sequence alignment algorithm combining hidden Markov model optimized by particle swarm optimization with partition function Zhan, Qing Wang, Nan Jin, Shuilin Tan, Renjie Jiang, Qinghua Wang, Yadong BMC Bioinformatics Research BACKGROUND: During procedures for conducting multiple sequence alignment, that is so essential to use the substitution score of pairwise alignment. To compute adaptive scores for alignment, researchers usually use Hidden Markov Model or probabilistic consistency methods such as partition function. Recent studies show that optimizing the parameters for hidden Markov model, as well as integrating hidden Markov model with partition function can raise the accuracy of alignment. The combination of partition function and optimized HMM, which could further improve the alignment’s accuracy, however, was ignored by these researches. RESULTS: A novel algorithm for MSA called ProbPFP is presented in this paper. It intergrate optimized HMM by particle swarm with partition function. The algorithm of PSO was applied to optimize HMM’s parameters. After that, the posterior probability obtained by the HMM was combined with the one obtained by partition function, and thus to calculate an integrated substitution score for alignment. In order to evaluate the effectiveness of ProbPFP, we compared it with 13 outstanding or classic MSA methods. The results demonstrate that the alignments obtained by ProbPFP got the maximum mean TC scores and mean SP scores on these two benchmark datasets: SABmark and OXBench, and it got the second highest mean TC scores and mean SP scores on the benchmark dataset BAliBASE. ProbPFP is also compared with 4 other outstanding methods, by reconstructing the phylogenetic trees for six protein families extracted from the database TreeFam, based on the alignments obtained by these 5 methods. The result indicates that the reference trees are closer to the phylogenetic trees reconstructed from the alignments obtained by ProbPFP than the other methods. CONCLUSIONS: We propose a new multiple sequence alignment method combining optimized HMM and partition function in this paper. The performance validates this method could make a great improvement of the alignment’s accuracy. BioMed Central 2019-11-25 /pmc/articles/PMC6876095/ /pubmed/31760933 http://dx.doi.org/10.1186/s12859-019-3132-7 Text en © The Author(s) 2019 Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License(http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver(http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.
spellingShingle Research
Zhan, Qing
Wang, Nan
Jin, Shuilin
Tan, Renjie
Jiang, Qinghua
Wang, Yadong
ProbPFP: a multiple sequence alignment algorithm combining hidden Markov model optimized by particle swarm optimization with partition function
title ProbPFP: a multiple sequence alignment algorithm combining hidden Markov model optimized by particle swarm optimization with partition function
title_full ProbPFP: a multiple sequence alignment algorithm combining hidden Markov model optimized by particle swarm optimization with partition function
title_fullStr ProbPFP: a multiple sequence alignment algorithm combining hidden Markov model optimized by particle swarm optimization with partition function
title_full_unstemmed ProbPFP: a multiple sequence alignment algorithm combining hidden Markov model optimized by particle swarm optimization with partition function
title_short ProbPFP: a multiple sequence alignment algorithm combining hidden Markov model optimized by particle swarm optimization with partition function
title_sort probpfp: a multiple sequence alignment algorithm combining hidden markov model optimized by particle swarm optimization with partition function
topic Research
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6876095/
https://www.ncbi.nlm.nih.gov/pubmed/31760933
http://dx.doi.org/10.1186/s12859-019-3132-7
work_keys_str_mv AT zhanqing probpfpamultiplesequencealignmentalgorithmcombininghiddenmarkovmodeloptimizedbyparticleswarmoptimizationwithpartitionfunction
AT wangnan probpfpamultiplesequencealignmentalgorithmcombininghiddenmarkovmodeloptimizedbyparticleswarmoptimizationwithpartitionfunction
AT jinshuilin probpfpamultiplesequencealignmentalgorithmcombininghiddenmarkovmodeloptimizedbyparticleswarmoptimizationwithpartitionfunction
AT tanrenjie probpfpamultiplesequencealignmentalgorithmcombininghiddenmarkovmodeloptimizedbyparticleswarmoptimizationwithpartitionfunction
AT jiangqinghua probpfpamultiplesequencealignmentalgorithmcombininghiddenmarkovmodeloptimizedbyparticleswarmoptimizationwithpartitionfunction
AT wangyadong probpfpamultiplesequencealignmentalgorithmcombininghiddenmarkovmodeloptimizedbyparticleswarmoptimizationwithpartitionfunction