{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T17:17:37Z","timestamp":1782926257214,"version":"3.54.5"},"reference-count":41,"publisher":"Oxford University Press (OUP)","issue":"16","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,8,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Motivation: Multiple sequence alignment is of central importance to bioinformatics and computational biology. Although a large number of algorithms for computing a multiple sequence alignment have been designed, the efficient computation of highly accurate multiple alignments is still a challenge.<\/jats:p>\n               <jats:p>Results: We present MSAProbs, a new and practical multiple alignment algorithm for protein sequences. The design of MSAProbs is based on a combination of pair hidden Markov models and partition functions to calculate posterior probabilities. Furthermore, two critical bioinformatics techniques, namely weighted probabilistic consistency transformation and weighted profile\u2013profile alignment, are incorporated to improve alignment accuracy. Assessed using the popular benchmarks: BAliBASE, PREFAB, SABmark and OXBENCH, MSAProbs achieves statistically significant accuracy improvements over the existing top performing aligners, including ClustalW, MAFFT, MUSCLE, ProbCons and Probalign. Furthermore, MSAProbs is optimized for multi-core CPUs by employing a multi-threaded design, leading to a competitive execution time compared to other aligners.<\/jats:p>\n               <jats:p>Availability: The source code of MSAProbs, written in C++, is freely and publicly available from http:\/\/msaprobs.sourceforge.net.<\/jats:p>\n               <jats:p>Contact: \u00a0liuy0039@ntu.edu.sg<\/jats:p>","DOI":"10.1093\/bioinformatics\/btq338","type":"journal-article","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T00:19:35Z","timestamp":1277425175000},"page":"1958-1964","source":"Crossref","is-referenced-by-count":216,"title":["MSAProbs: multiple sequence alignment based on pair hidden Markov models and partition function posterior probabilities"],"prefix":"10.1093","volume":"26","author":[{"given":"Yongchao","family":"Liu","sequence":"first","affiliation":[{"name":"School of Computer Engineering, Nanyang Technological University, Singapore 639798"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bertil","family":"Schmidt","sequence":"additional","affiliation":[{"name":"School of Computer Engineering, Nanyang Technological University, Singapore 639798"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Douglas L.","family":"Maskell","sequence":"additional","affiliation":[{"name":"School of Computer Engineering, Nanyang Technological University, Singapore 639798"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2010,6,23]]},"reference":[{"key":"2023012508022278700_B1","doi-asserted-by":"crossref","first-page":"3389","DOI":"10.1093\/nar\/25.17.3389","article-title":"Gapped BLAST and PSI-BLAST: a new generation of protein database search programs","volume":"25","author":"Altschul","year":"1997","journal-title":"Nucleic Acids Res."},{"key":"2023012508022278700_B2","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1093\/nar\/29.1.323","article-title":"BAliBASE (Benchmark Alignment dataBASE): enhancements for repeats, transmembrane sequences and circular permutations","volume":"29","author":"Bahr","year":"2001","journal-title":"Nucleic Acids Res."},{"key":"2023012508022278700_B3","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0022-2836(87)90316-0","article-title":"A strategy for the rapid multiple alignment of protein sequences. confidence levels from tertiary structure comparisons","volume":"198","author":"Barton","year":"1987","journal-title":"J. Mol. Biol."},{"key":"2023012508022278700_B4","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1093\/bioinformatics\/7.4.479","article-title":"A novel randomized iterative strategy for aligning multiple protein sequences","volume":"7","author":"Berger","year":"1991","journal-title":"Bioinformatics"},{"key":"2023012508022278700_B5","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1093\/protein\/8.7.647","article-title":"Optimal protein structure alignments by multiple linkage clustering: application to distantly related proteins","volume":"8","author":"Boutonnet","year":"1995","journal-title":"Protein Eng."},{"key":"2023012508022278700_B6","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1093\/nar\/28.1.254","article-title":"The ASTRAL compendium for protein structure and sequence analysis","volume":"28","author":"Brenner","year":"2000","journal-title":"Nucleic Acids Res."},{"key":"2023012508022278700_B7","doi-asserted-by":"crossref","first-page":"10881","DOI":"10.1093\/nar\/16.22.10881","article-title":"Multiple sequence alignment with hierarchical clustering","volume":"16","author":"Corpet","year":"1988","journal-title":"Nucleic Acids Res."},{"key":"2023012508022278700_B8","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1101\/gr.2821705","article-title":"ProbCons: probabilistic consistency-based multiple sequence alignment","volume":"15","author":"Do","year":"2005","journal-title":"Genome Res."},{"key":"2023012508022278700_B9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511790492","volume-title":"Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids.","author":"Durbin","year":"1998"},{"key":"2023012508022278700_B10","doi-asserted-by":"crossref","first-page":"1792","DOI":"10.1093\/nar\/gkh340","article-title":"MUSCLE: multiple sequence alignment with high accuracy and high throughput","volume":"32","author":"Edgar","year":"2004","journal-title":"Nucleic Acids Res."},{"key":"2023012508022278700_B11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1186\/1471-2105-5-113","article-title":"MUSCLE: a multiple sequence alignment method with reduced time and space complexity","volume":"5","author":"Edgar","year":"2004","journal-title":"BMC Bioinformatics"},{"key":"2023012508022278700_B12","doi-asserted-by":"crossref","DOI":"10.1093\/nar\/gkp1196","article-title":"Quality measures for protein alignment benchmarks","author":"Edgar","year":"2010","journal-title":"Nucleic Acids Res."},{"key":"2023012508022278700_B13","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/BF02603120","article-title":"Progressive sequence alignment as a prerequisite to correct phylogenetic trees","volume":"25","author":"Feng","year":"1987","journal-title":"J. Mol. Evol."},{"key":"2023012508022278700_B14","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1016\/0022-2836(94)90012-4","article-title":"Volume changes in protein evolution","volume":"236","author":"Gerstein","year":"1994","journal-title":"J. Mol. Biol."},{"key":"2023012508022278700_B15","doi-asserted-by":"crossref","first-page":"1443","DOI":"10.1126\/science.1604319","article-title":"Exhaustive matching of the entire protein sequence database","volume":"256","author":"Gonnet","year":"1992","journal-title":"Science"},{"key":"2023012508022278700_B16","first-page":"543","article-title":"A weighting system and algorithm for aligning many phylogenetically related sequences","volume":"11","author":"Gotoh","year":"1995","journal-title":"Comput. Appl. Biosci."},{"key":"2023012508022278700_B17","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1016\/0022-2836(94)90032-9","article-title":"Position-based sequence weights","volume":"243","author":"Henikoff","year":"1994","journal-title":"J. Mol. Biol."},{"key":"2023012508022278700_B18","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1093\/nar\/26.1.316","article-title":"Touring protein fold space with Dali\/FSSP","volume":"26","author":"Holm","year":"1998","journal-title":"Nucleic Acids Res."},{"key":"2023012508022278700_B19","doi-asserted-by":"crossref","first-page":"3059","DOI":"10.1093\/nar\/gkf436","article-title":"MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform","volume":"30","author":"Katoh","year":"2002","journal-title":"Nucleic Acids Res."},{"key":"2023012508022278700_B20","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1093\/nar\/gki198","article-title":"MAFFT version 5: improvement in accuracy of multiple sequence alignment","volume":"33","author":"Katoh","year":"2005","journal-title":"Nucleic Acids Res."},{"key":"2023012508022278700_B21","doi-asserted-by":"crossref","first-page":"1503","DOI":"10.1006\/jmbi.1994.1104","article-title":"Hidden markov models in computational biology: applications to protein modeling","volume":"235","author":"Krogh","year":"1994","journal-title":"J. Mol.Biol."},{"key":"2023012508022278700_B22","doi-asserted-by":"crossref","first-page":"2948","DOI":"10.1093\/bioinformatics\/btm404","article-title":"Clustal W and Clustal X version 2.0","volume":"23","author":"Larkin","year":"2007","journal-title":"Bioinformatics"},{"key":"2023012508022278700_B23","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1093\/protein\/8.10.999","article-title":"A reliable sequence alignment method based on probabilities of residue correspondences","volume":"8","author":"Miyazawa","year":"1995","journal-title":"Protein Eng."},{"key":"2023012508022278700_B24","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1093\/bioinformatics\/14.5.407","article-title":"COFFEE: an objective function for multiple sequence alignments","volume":"14","author":"Notredame","year":"1998","journal-title":"Bioinformatics"},{"key":"2023012508022278700_B25","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1006\/jmbi.2000.4042","article-title":"T-Coffee: a novel method for fast and accurate multiple sequence alignment","volume":"302","author":"Notredame","year":"2000","journal-title":"J. Mol. Biol."},{"key":"2023012508022278700_B26","author":"OpenMP","year":"2010","journal-title":"OpenMP tutorial."},{"key":"2023012508022278700_B27","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/5.18626","article-title":"A tutorial on hidden markov models and selected applications in speech recognition","volume":"77","author":"Rabiner","year":"1989","journal-title":"Proceedings of the IEEE"},{"key":"2023012508022278700_B28","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1186\/1471-2105-4-47","article-title":"OXBench: a benchmark for evaluation of protein multiple sequence alignment accuracy","volume":"4","author":"Raghava","year":"2003","journal-title":"BMC Bioinformatics"},{"key":"2023012508022278700_B29","doi-asserted-by":"crossref","first-page":"2715","DOI":"10.1093\/bioinformatics\/btl472","article-title":"Probalign: multiple sequence alignment using partition function posterior probabilities","volume":"22","author":"Roshan","year":"2006","journal-title":"Bioinformatics"},{"key":"2023012508022278700_B30","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/prot.340140216","article-title":"Multiple protein sequence alignment from tertiary structure comparison: assignment of global and residue confidence levels","volume":"14","author":"Russell","year":"1992","journal-title":"Proteins"},{"key":"2023012508022278700_B31","first-page":"406","article-title":"The neighbor-joining method: a new method for reconstructing phylogenetic trees","volume":"4","author":"Saitou","year":"1987","journal-title":"Mol. Biol. Evol."},{"key":"2023012508022278700_B32","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1093\/protein\/11.9.739","article-title":"Protein structure alignment by incremental combinatorial extension (CE) of the optimal path","volume":"11","author":"Shindyalov","year":"1998","journal-title":"Protein Eng."},{"key":"2023012508022278700_B33","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1093\/bioinformatics\/17.2.200","article-title":"3Dee: a database of protein structural domains","volume":"17","author":"Siddiqui","year":"2001","journal-title":"Bioinformatics"},{"key":"2023012508022278700_B34","volume-title":"Numerical taxonomy.","author":"Sneath","year":"1973"},{"key":"2023012508022278700_B35","first-page":"729","article-title":"A note on the neighbor-joining method of Saitou and Nei","volume":"5","author":"Studier","year":"1988","journal-title":"Mol. Biol. Evol."},{"key":"2023012508022278700_B36","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/0022-2836(89)90592-5","article-title":"A method for multiple sequence alignment with gaps","volume":"209","author":"Subbiah","year":"1989","journal-title":"J. Mol. Biol."},{"key":"2023012508022278700_B37","doi-asserted-by":"crossref","first-page":"4673","DOI":"10.1093\/nar\/22.22.4673","article-title":"CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice","volume":"22","author":"Thompson","year":"1994","journal-title":"Nucleic Acids Res."},{"key":"2023012508022278700_B38","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1093\/bioinformatics\/15.1.87","article-title":"BAliBASE: a benchmark alignment database for the evaluation of multiple alignment programs","volume":"15","author":"Thompson","year":"1999","journal-title":"Bioinformatics"},{"key":"2023012508022278700_B39","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1002\/prot.20527","article-title":"BAliBASE 3.0: latest developments of the multiple sequence alignment benchmark","volume":"61","author":"Thompson","year":"2005","journal-title":"Proteins"},{"key":"2023012508022278700_B40","doi-asserted-by":"crossref","first-page":"1428","DOI":"10.1093\/bioinformatics\/bth116","article-title":"Align-m\u2013a new algorithm for multiple alignment of highly divergent sequences","volume":"20","author":"Van Walle","year":"2004","journal-title":"Bioinformatics"},{"key":"2023012508022278700_B41","doi-asserted-by":"crossref","first-page":"119","DOI":"10.2307\/3001946","article-title":"Probability tables for individual comparisons by ranking methods","volume":"3","author":"Wilcoxon","year":"1947","journal-title":"Biometrics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/26\/16\/1958\/48854142\/bioinformatics_26_16_1958.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/26\/16\/1958\/48854142\/bioinformatics_26_16_1958.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T08:03:14Z","timestamp":1674633794000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/26\/16\/1958\/218540"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,23]]},"references-count":41,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2010,8,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btq338","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2010,8,15]]},"published":{"date-parts":[[2010,6,23]]}}}