{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T04:05:39Z","timestamp":1790395539320,"version":"4.1.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,4,27]],"date-time":"2005-04-27T00:00:00Z","timestamp":1114560000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0\/"},{"start":{"date-parts":[[2005,4,27]],"date-time":"2005-04-27T00:00:00Z","timestamp":1114560000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0\/"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:sec>\n                    <jats:title>Background<\/jats:title>\n                    <jats:p>\n                      Distance-based methods are popular for reconstructing evolutionary trees thanks to their speed and generality. A number of methods exist for estimating distances from sequence alignments, which often involves some sort of correction for multiple substitutions. The problem is to accurately estimate the number of true substitutions given an observed alignment. So far, the most accurate protein distance estimators have looked for the optimal matrix in a series of transition probability matrices,\n                      <jats:italic>e.g.<\/jats:italic>\n                      the Dayhoff series. The evolutionary distance between two aligned sequences is here estimated as the evolutionary distance of the optimal matrix. The optimal matrix can be found either by an iterative search for the Maximum Likelihood matrix, or by integration to find the Expected Distance. As a consequence, these methods are more complex to implement and computationally heavier than correction-based methods. Another problem is that the result may vary substantially depending on the evolutionary model used for the matrices. An ideal distance estimator should produce consistent and accurate distances independent of the evolutionary model used.\n                    <\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Results<\/jats:title>\n                    <jats:p>\n                      We propose a correction-based protein sequence estimator called\n                      <jats:italic>Scoredist<\/jats:italic>\n                      . It uses a logarithmic correction of observed divergence based on the alignment score according to the BLOSUM62 score matrix. We evaluated\n                      <jats:italic>Scoredist<\/jats:italic>\n                      and a number of optimal matrix methods using three evolutionary models for both training and testing Dayhoff, Jones-Taylor-Thornton, and M\u00fcller-Vingron, as well as Whelan and Goldman solely for testing. Test alignments with known distances between 0.01 and 2 substitutions per position (1\u2013200 PAM) were simulated using ROSE.\n                      <jats:italic>Scoredist<\/jats:italic>\n                      proved as accurate as the optimal matrix methods, yet substantially more robust. When trained on one model but tested on another one,\n                      <jats:italic>Scoredist<\/jats:italic>\n                      was nearly always more accurate. The Jukes-Cantor and Kimura correction methods were also tested, but were substantially less accurate.\n                    <\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Conclusion<\/jats:title>\n                    <jats:p>\n                      The\n                      <jats:italic>Scoredist<\/jats:italic>\n                      distance estimator is fast to implement and run, and combines robustness with accuracy.\n                      <jats:italic>Scoredist<\/jats:italic>\n                      has been incorporated into the Belvu alignment viewer, which is available at\n                      <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"ftp:\/\/ftp.cgb.ki.se\/pub\/prog\/belvu\/\">ftp:\/\/ftp.cgb.ki.se\/pub\/prog\/belvu\/<\/jats:ext-link>\n                      .\n                    <\/jats:p>\n                  <\/jats:sec>","DOI":"10.1186\/1471-2105-6-108","type":"journal-article","created":{"date-parts":[[2005,4,27]],"date-time":"2005-04-27T15:53:51Z","timestamp":1114617231000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":108,"title":["Scoredist: A simple and robust protein sequence distance estimator"],"prefix":"10.1186","volume":"6","author":[{"given":"Erik LL","family":"Sonnhammer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Volker","family":"Hollich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,4,27]]},"reference":[{"key":"433_CR1","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1093\/oxfordjournals.molbev.a026231","volume":"17","author":"WJ Bruno","year":"2000","unstructured":"Bruno WJ, Socci ND, Halpern AL: Weighted Neighbor Joining: A Likelihood-Based Approach to Distance-Based Phylogeny Reconstruction. Mol Biol Evol 2000, 17: 189\u2013197.","journal-title":"Mol Biol Evol"},{"key":"433_CR2","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1093\/oxfordjournals.molbev.a025808","volume":"14","author":"O Gascuel","year":"1997","unstructured":"Gascuel O: BIONJ: An Improved Version on the NJ Algorithm Based on a Simple Model of Sequence Data. Mol Biol Evol 1997, 14: 685\u2013695.","journal-title":"Mol Biol Evol"},{"key":"433_CR3","first-page":"406","volume":"4","author":"N Saitou","year":"1987","unstructured":"Saitou N, Nei M: The Neighbor-joining Method: A New Method for Reconstructing Phylogenetic Trees. Mol Biol Evol 1987, 4: 406\u2013425.","journal-title":"Mol Biol Evol"},{"key":"433_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1186\/1471-2105-3-14","volume":"3","author":"C Zmasek","year":"2002","unstructured":"Zmasek C, Eddy S: RIO: analyzing proteomes by automated phylogenenomics using resampled inference of orthologs. BMC Bioinformatics 2002, 3: 14. 10.1186\/1471-2105-3-14","journal-title":"BMC Bioinformatics"},{"issue":"9","key":"433_CR5","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.1093\/bioinformatics\/18.9.1272","volume":"18","author":"V Hollich","year":"2002","unstructured":"Hollich V, Storm CE, Sonnhammer ELL: OrthoGUI: graphical presentation of Orthostrapper results. Bioinformatics 2002, 18(9):1272\u20131273. 10.1093\/bioinformatics\/18.9.1272","journal-title":"Bioinformatics"},{"issue":"1","key":"433_CR6","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1093\/bioinformatics\/18.1.92","volume":"18","author":"CE Storm","year":"2002","unstructured":"Storm CE, Sonnhammer ELL: Automated ortholog inference from phylogenetic trees and calculation of orthology reliability. Bioinformatics 2002, 18(1):92\u201399. 10.1093\/bioinformatics\/18.1.92","journal-title":"Bioinformatics"},{"key":"433_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/B978-1-4832-3211-9.50009-7","volume-title":"Mammalian Protein Metabolism","author":"TH Jukes","year":"1969","unstructured":"Jukes TH, Cantor CR: Evolution of protein molecules. In Mammalian Protein Metabolism. Edited by: Munro HN. Academic Press; 1969:21\u2013132."},{"key":"433_CR8","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195135848.001.0001","volume-title":"Molecular Evolution and Phylogenetics","author":"M Nei","year":"2000","unstructured":"Nei M, Kumar S: Molecular Evolution and Phylogenetics. New York: Oxford University Press; 2000."},{"key":"433_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511623486","volume-title":"The Neutral Theory of Molecular Evolution","author":"M Kimura","year":"1983","unstructured":"Kimura M: The Neutral Theory of Molecular Evolution. Cambridge: Cambridge University Press; 1983."},{"key":"433_CR10","first-page":"353","volume-title":"Atlas of Protein Sequence and Structure vol 5 supplement 3","author":"MO Dayhoff","year":"1978","unstructured":"Dayhoff MO, Schwartz RM, Orcutt BC: A model of Evolutionary Change in Proteins. In Atlas of Protein Sequence and Structure vol 5 supplement 3. Edited by: Dayhoff MO. National Biomedical Research Foundation, Washington; 1978:353\u2013352."},{"issue":"3","key":"433_CR11","first-page":"275","volume":"8","author":"DT Jones","year":"1992","unstructured":"Jones DT, Taylor WR, Thornton JM: The rapid generation of mutation data matrices from protein sequences. Comput Appl Biosci 1992, 8(3):275\u2013282.","journal-title":"Comput Appl Biosci"},{"issue":"6","key":"433_CR12","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1089\/10665270050514918","volume":"7","author":"T M\u00fcller","year":"2000","unstructured":"M\u00fcller T, Vingron M: Modeling amino acid replacement. J Comput Biol 2000, 7(6):761\u2013776. 10.1089\/10665270050514918","journal-title":"J Comput Biol"},{"issue":"5","key":"433_CR13","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1093\/oxfordjournals.molbev.a003851","volume":"18","author":"S Whelan","year":"2001","unstructured":"Whelan S, Goldman N: A general empirical model of protein evolution derived from multiple protein families using a maximum-likelihood approach. Mol Biol Evol 2001, 18(5):691\u2013699.","journal-title":"Mol Biol Evol"},{"issue":"22","key":"433_CR14","doi-asserted-by":"publisher","first-page":"10915","DOI":"10.1073\/pnas.89.22.10915","volume":"89","author":"S Henikoff","year":"1992","unstructured":"Henikoff S, Henikoff JG: Amino acid substitution matrices from protein blocks. Proc Natl Acad Sci USA 1992, 89(22):10915\u201310919.","journal-title":"Proc Natl Acad Sci USA"},{"issue":"1","key":"433_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1089\/cmb.1996.3.1","volume":"3","author":"P Agarwal","year":"1996","unstructured":"Agarwal P, States JS: A Bayesian Evolutionary Distance for Parametrically Aligned Sequences. J Comput Biol 1996, 3(1):1\u201317.","journal-title":"J Comput Biol"},{"issue":"2","key":"433_CR16","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1093\/bioinformatics\/14.2.157","volume":"14","author":"J Stoye","year":"1998","unstructured":"Stoye J, Evers D, Meyer F: Rose: generating sequence families. Bioinformatics 1998, 14(2):157\u2013163. 10.1093\/bioinformatics\/14.2.157","journal-title":"Bioinformatics"},{"key":"433_CR17","unstructured":"Belvu website[http:\/\/www.cgb.ki.se\/cgb\/groups\/sonnhammer\/Belvu.html]"},{"key":"433_CR18","unstructured":"Stockholm data format[http:\/\/www.cgb.ki.se\/cgb\/groups\/sonnhammer\/Stockholm.html]"},{"key":"433_CR19","first-page":"164","volume":"5","author":"J Felsenstein","year":"1989","unstructured":"Felsenstein J: PHYLIP \u2013 Phylogeny Inference Package (Version 3.2). Cladistics 1989, 5: 164\u2013166.","journal-title":"Cladistics"},{"key":"433_CR20","unstructured":"Belvu download site[ftp:\/\/ftp.cgb.ki.se\/pub\/prog\/belvu\/]"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-6-108.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/1471-2105-6-108\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-6-108.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T08:11:26Z","timestamp":1728288686000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-6-108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4,27]]},"references-count":20,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2005,12]]}},"alternative-id":["433"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-6-108","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,4,27]]},"assertion":[{"value":"30 December 2004","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2005","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2005","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"108"}}