Scoredist: A simple and robust protein sequence distance estimator
Open Access
- 27 April 2005
- journal article
- Published by Springer Nature in BMC Bioinformatics
- Vol. 6 (1) , 108
- https://doi.org/10.1186/1471-2105-6-108
Abstract
Background: 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, e.g. 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. Results: We propose a correction-based protein sequence estimator called Scoredist. It uses a logarithmic correction of observed divergence based on the alignment score according to the BLOSUM62 score matrix. We evaluated Scoredist and a number of optimal matrix methods using three evolutionary models for both training and testing Dayhoff, Jones-Taylor-Thornton, and Müller-Vingron, as well as Whelan and Goldman solely for testing. Test alignments with known distances between 0.01 and 2 substitutions per position (1–200 PAM) were simulated using ROSE. Scoredist proved as accurate as the optimal matrix methods, yet substantially more robust. When trained on one model but tested on another one, Scoredist was nearly always more accurate. The Jukes-Cantor and Kimura correction methods were also tested, but were substantially less accurate. Conclusion: The Scoredist distance estimator is fast to implement and run, and combines robustness with accuracy. Scoredist has been incorporated into the Belvu alignment viewer, which is available at ftp://ftp.cgb.ki.se/pub/prog/belvu/.Keywords
This publication has 15 references indexed in Scilit:
- OrthoGUI: graphical presentation of Orthostrapper resultsBioinformatics, 2002
- RIO: Analyzing proteomes by automated phylogenomics using resampled inference of orthologsBMC Bioinformatics, 2002
- Automated ortholog inference from phylogenetic trees and calculation of orthology reliabilityBioinformatics, 2002
- A General Empirical Model of Protein Evolution Derived from Multiple Protein Families Using a Maximum-Likelihood ApproachMolecular Biology and Evolution, 2001
- Modeling Amino Acid ReplacementJournal of Computational Biology, 2000
- Weighted Neighbor Joining: A Likelihood-Based Approach to Distance-Based Phylogeny ReconstructionMolecular Biology and Evolution, 2000
- BIONJ: an improved version of the NJ algorithm based on a simple model of sequence dataMolecular Biology and Evolution, 1997
- Amino acid substitution matrices from protein blocks.Proceedings of the National Academy of Sciences, 1992
- The rapid generation of mutation data matrices from protein sequencesBioinformatics, 1992
- The neighbor-joining method: a new method for reconstructing phylogenetic trees.Molecular Biology and Evolution, 1987