Evidence map›Paper›PMID 31760933›Full record

ArticleBMC bioinformatics2019

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

Qing Zhan, Nan Wang, Shuilin Jin, Renjie Tan, Qinghua Jiang, Yadong Wang

Open access · goldAbstract readEvaluation Study
In one paragraph

Article in BMC bioinformatics, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

0numbers the graph read from it
0cells of the map it votes in
5citing papers in PubMed
0.9field-weighted citation impact, top 25% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

5 citing papers in PubMed, 17 citations in OpenAlex.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors at 1 institution in 1 country.

Qing ZhanSchool of Computer Science and Technology, Harbin Institute of Technology, Harbin, 150001, China.
Nan WangDepartment of Mathematics, Harbin Institute of Technology, Harbin, 150001, China.
Shuilin JinDepartment of Mathematics, Harbin Institute of Technology, Harbin, 150001, China.
Renjie TanSchool of Computer Science and Technology, Harbin Institute of Technology, Harbin, 150001, China.
Qinghua JiangSchool of Life Science and Technology, Harbin Institute of Technology, Harbin, 150001, China.
Yadong WangSchool of Computer Science and Technology, Harbin Institute of Technology, Harbin, 150001, China. ydwang@hit.edu.cn.
Harbin Institute of Technology · CN

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundDuring 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.

resultsA 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.

conclusionsWe 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.

Indexed as

AlgorithmsAnimalsComputational BiologyHumansMarkov ChainsMultigene FamilyPhylogenyProteinsSequence AlignmentSoftwareProteinsHidden Markov ModelMultiple sequence alignmentParticle swarm optimizationPartition function

Identifiers

PMID31760933
PMCPMC6876095
OpenAlexW2990713549

What Socratic holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the Socratic graph.