Efficiency of the neighbor-joining method in reconstructing deep and shallow evolutionary relationships in large phylogenies

Journal of Molecular Evolution

Volumn 51, Issue 6, 2000, Pages 544-553

  Kumar, Sudhir ^a   Gadagkar, Sudhindra R ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

Accuracy; Deep versus shallow branches; Large phylogenies; Neighbor joining method; Phylogenetic inference; Zero length branches

Indexed keywords

ARTICLE; COMPUTER SIMULATION; EVOLUTION; GENE SEQUENCE; PERFORMANCE; PHYLOGENY; TAXONOMY;

EID: 0034548435     PISSN: 00222844     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002390010118     Document Type: Article

References (31)

1. Evolution and functional diversification of paired box (Pax) DNA-binding domains
2. Neighbor-joining uses the optimal weight for net divergence
3. HOVERGEN: A database of homologous vertebrate genes
4. A note on Sattath and Tversky's, Saitou and Nei's, and Studier and Keppler's algorithms for inferring phylogenies from evolutionary distances
5. Concerning the NJ algorithm and its unweighted version, UNJ
6. Is it better to add taxa or characters to a difficult phylogenetic problem?
7. Using CLUSTAL for multiple sequence alignments
8. Inferring complex phylogenies
9. Taxonomic sampling, phylogenetic accuracy, and investigator bias
10. Evolution of protein molecales
11. General inconsistency conditions for maximum parsimony: Effects of branch lengths and increasing numbers of taxa
12. Large-scale phylogenies and measuring the performance of phylogenetic estimators
13. A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates
14. A stepwise algorithm for finding minimum evolution trees
15. Evolutionary relationships of eukaryotic kingdoms
16. Evolution of the hedgehog gene family
17. The optimization principle in phylogenetic analysis tends to give incorrect topologies when the number of nucleotides or amino acids used is small
18. Building phylogenies: Are the big easy?
19. Statistical properties of the ordinary least squares, generalized least-squares and minimum-evolution methods of phylogenetic inference
20. Four cluster analysis: A simple method to test phylogenetic hypotheses
21. Reconstruction of gene trees from sequence data
22. Relative efficiencies of the Fitch-Margoliash, maximum-parsimony, maximum-likelihood, minimum-evolution, and neighbor-joining methods of phylogenetic tree reconstruction in obtaining the correct tree
23. The neighbor-joining method: A new method for reconstructing phylogenetic trees
24. Confidence in evolutionary trees from biological sequence data
25. Accuracy of neighbor joining for n-taxon trees
26. A method for molecular phylogeny construction by direct use of nucleotide sequence data
27. Relative efficiencies of the maximum-likelihood, neighbor-joining, and maximum-parsimony methods when substitution rate varies with site
28. Are big trees indeed easy?