Skip Navigation

This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (PDF) Freely available
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (16)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Ranwez, V.
Right arrow Articles by Gascuel, O.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Ranwez, V.
Right arrow Articles by Gascuel, O.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Molecular Biology and Evolution 19:1952-1963 (2002)
© 2002 Society for Molecular Biology and Evolution

Improvement of Distance-Based Phylogenetic Methods by a Local Maximum Likelihood Approach Using Triplets

Vincent Ranwez and Olivier Gascuel

Département Informatique Fondamentale et Applications, LIRMM, Montpellier Cedex 5, France

We introduce a new approach to estimate the evolutionary distance between two sequences. This approach uses a tree with three leaves: two of them correspond to the studied sequences, whereas the third is chosen to handle long-distance estimation. The branch lengths of this tree are obtained by likelihood maximization and are then used to deduce the desired distance. This approach, called TripleML, improves the precision of evolutionary distance estimates, and thus the topological accuracy of distance-based methods. TripleML can be used with neighbor-joining–like (NJ-like) methods not only to compute the initial distance matrix but also to estimate new distances encountered during the agglomeration process. Computer simulations indicate that using TripleML significantly improves the topological accuracy of NJ, BioNJ, and Weighbor, while conserving a reasonable computation time. With randomly generated 24-taxon trees and realistic parameter values, combining NJ with TripleML reduces the number of wrongly inferred branches by about 11% (against 2.6% and 5.5% for BioNJ and Weighbor, respectively). Moreover, this combination requires only about 1.5 min to infer a phylogeny of 96 sequences composed of 1,200 nucleotides, as compared with 6.5 h for FastDNAml on the same machine (PC 466 MHz).


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Syst BiolHome page
D. A. Morrison
Increasing the Efficiency of Searches for the Maximum Likelihood Tree in a Phylogenetic Analysis of up to 150 Nucleotide Sequences
Syst Biol, December 1, 2007; 56(6): 988 - 1010.
[Abstract] [Full Text] [PDF]

Home page
 Syst BiolHome page
K. Geuten, T. Massingham, P. Darius, E. Smets, and N. Goldman
Experimental Design Criteria in Phylogenetics: Where to Add Taxa
Syst Biol, August 1, 2007; 56(4): 609 - 622.
[Abstract] [Full Text] [PDF]

Home page
 Mol Biol EvolHome page
D. Levy, R. Yoshida, and L. Pachter
Beyond Pairwise Distances: Neighbor-Joining with Phylogenetic Diversity Estimates
Mol. Biol. Evol., March 1, 2006; 23(3): 491 - 498.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
W. Hordijk and O. Gascuel
Improving the efficiency of SPR moves in phylogenetic tree search methods based on maximum likelihood
Bioinformatics, December 15, 2005; 21(24): 4338 - 4347.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
T. M. Keane, T. J. Naughton, S. A. A. Travers, J. O. McInerney, and G. P. McCormack
DPRml: distributed phylogeny reconstruction by maximum likelihood
Bioinformatics, April 1, 2005; 21(7): 969 - 974.
[Abstract] [Full Text] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.