Efficiency of the neighbor-joining method in reconstructing deep and shallow evolutionary relationships in large phylogenies
- PMID: 11116328
- DOI: 10.1007/s002390010118
Efficiency of the neighbor-joining method in reconstructing deep and shallow evolutionary relationships in large phylogenies
Abstract
The neighbor-joining (NJ) method is widely used in reconstructing large phylogenies because of its computational speed and the high accuracy in phylogenetic inference as revealed in computer simulation studies. However, most computer simulation studies have quantified the overall performance of the NJ method in terms of the percentage of branches inferred correctly or the percentage of replications in which the correct tree is recovered. We have examined other aspects of its performance, such as the relative efficiency in correctly reconstructing shallow (close to the external branches of the tree) and deep branches in large phylogenies; the contribution of zero-length branches to topological errors in the inferred trees; and the influence of increasing the tree size (number of sequences), evolutionary rate, and sequence length on the efficiency of the NJ method. Results show that the correct reconstruction of deep branches is no more difficult than that of shallower branches. The presence of zero-length branches in realized trees contributes significantly to the overall error observed in the NJ tree, especially in large phylogenies or slowly evolving genes. Furthermore, the tree size does not influence the efficiency of NJ in reconstructing shallow and deep branches in our simulation study, in which the evolutionary process is assumed to be homogeneous in all lineages.
Similar articles
-
Prospects for inferring very large phylogenies by using the neighbor-joining method.Proc Natl Acad Sci U S A. 2004 Jul 27;101(30):11030-5. doi: 10.1073/pnas.0404206101. Epub 2004 Jul 16. Proc Natl Acad Sci U S A. 2004. PMID: 15258291 Free PMC article.
-
A multi-neighbor-joining approach for phylogenetic tree reconstruction and visualization.Genet Mol Res. 2005 Sep 30;4(3):525-34. Genet Mol Res. 2005. PMID: 16342037
-
NJML: a hybrid algorithm for the neighbor-joining and maximum-likelihood methods.Mol Biol Evol. 2000 Sep;17(9):1401-9. doi: 10.1093/oxfordjournals.molbev.a026423. Mol Biol Evol. 2000. PMID: 10958856
-
Neighbor-joining revealed.Mol Biol Evol. 2006 Nov;23(11):1997-2000. doi: 10.1093/molbev/msl072. Epub 2006 Jul 28. Mol Biol Evol. 2006. PMID: 16877499 Review.
-
Computational approaches to species phylogeny inference and gene tree reconciliation.Trends Ecol Evol. 2013 Dec;28(12):719-28. doi: 10.1016/j.tree.2013.09.004. Epub 2013 Oct 1. Trends Ecol Evol. 2013. PMID: 24094331 Free PMC article. Review.
Cited by
-
Phylogeny and species delimitation of the genus Longgenacris and Fruhstorferiola viridifemorata species group (Orthoptera: Acrididae: Melanoplinae) based on molecular evidence.PLoS One. 2020 Aug 26;15(8):e0237882. doi: 10.1371/journal.pone.0237882. eCollection 2020. PLoS One. 2020. PMID: 32845927 Free PMC article.
-
Genome-Wide Identification and Expression Analysis of the SHI-Related Sequence Family in Cassava.Genes (Basel). 2023 Apr 5;14(4):870. doi: 10.3390/genes14040870. Genes (Basel). 2023. PMID: 37107628 Free PMC article.
-
Prospects for inferring very large phylogenies by using the neighbor-joining method.Proc Natl Acad Sci U S A. 2004 Jul 27;101(30):11030-5. doi: 10.1073/pnas.0404206101. Epub 2004 Jul 16. Proc Natl Acad Sci U S A. 2004. PMID: 15258291 Free PMC article.
-
Identification of prokaryotic small proteins using a comparative genomic approach.Bioinformatics. 2011 Jul 1;27(13):1765-71. doi: 10.1093/bioinformatics/btr275. Epub 2011 May 5. Bioinformatics. 2011. PMID: 21551138 Free PMC article.
-
Fast NJ-like algorithms to deal with incomplete distance matrices.BMC Bioinformatics. 2008 Mar 26;9:166. doi: 10.1186/1471-2105-9-166. BMC Bioinformatics. 2008. PMID: 18366787 Free PMC article.
Publication types
MeSH terms
LinkOut - more resources
Full Text Sources
