Beyond pairwise distances: Neighbor-joining with phylogenetic diversity estimates

Molecular Biology and Evolution

Volumn 23, Issue 3, 2006, Pages 491-498

  Levy, Dan ^a   Yoshida, Ruriko ^b   Pachter, Lior ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b DUKE UNIVERSITY   (United States)

Author keywords

Neighbor joining; Phylogenetic diversity; Subtree weights

Indexed keywords

ALGORITHM; ARTICLE; GENETIC VARIABILITY; PHYLOGENETIC TREE; PHYLOGENY; SIMULATION;

ALGORITHMS; MATHEMATICS; MODELS, GENETIC; PHYLOGENY; VARIATION (GENETICS);

EID: 33244479049     PISSN: 07374038     EISSN: 15371719     Source Type: Journal    
DOI: 10.1093/molbev/msj059     Document Type: Article

References (21)

1. Atteson, K. 1999. The performance of neighbor-joining methods of phylogenetic reconstruction. Algorithmica 25:251-278.
2. Bruno, W., N. Socci, and A. Halpern. 2000. Weighted neighbor joining: a likelihood-based approach to distance-based phylogeny reconstruction. Mol. Biol. Evol. 17:189-197.
3. Bryant, D. 2005. On the uniqueness of the selection criterion in neighbor-joining. J. Classif. 22:3-15.
4. Bryant, D., and V. Moulton. 2004. NeighborNet: an agglomerative algorithm for the construction of planar phylogenetic networks. Mol. Biol. Evol. 21:255-265.
5. Buneman, P. 1971. The recovery of trees from measures of dissimilarity. Pp. 387-395 in F. Hodson, D. Kendall, and P. Tautu, eds. Mathematics in the archaeological and historical sciences. Edinburgh University Press, Edinburgh, United Kingdom.
6. Contois, M., and D. Levy. 2005. Small trees and generalized neighbor joining. Pp. 335-346 in L. Pachter and B. Sturmfels, eds. Algebraic statistics for computational biology. Cambridge University Press, Cambridge.
7. Faith, D. 1992. Conservation evaluation and phylogenetic diversity. Biol. Conserv. 61:1-10.
8. Gascuel, O. 1994. A note on Sattath and Tversky's Saitou and Nei's and Studier and Keppler's algorithms for inferring phylogenies from evolutionary distances. Mol. Biol. Evol. 11:961-963.
9. _. 1997a. BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data. Mol. Biol. Evol. 14:685-695.
10. _. 1997b. Concerning the NJ algorithm and its unweighted version, UNJ. Pp. 149-170 in B. Mirkin, F. McMorris, F. Roberts, and A. Rhetsky, eds. Mathematical hierarchies and biology. American Mathematical Society, Providence, R.I.
11. Hoşten, S., A. Khetan, and B. Sturmfels. 2005. Solving the likelihood equations. Found. Comput. Math. (in press).
12. Joly, S., and G. Calvé. 1995. Three way distances. J. Classif. 12:191-205.
13. Jukes, T., and C. Cantor. 1969. Evolution of protein molecules. Pp. 21-32 in H. N. Munro, ed. Mammalian protein metabolism. Academic Press, New York.
14. Kimura, M., and T. Ohta. 1972. On the stochastic model for estimation of mutational distance between homologous proteins. J. Mol. Evol. 2:87-90.
15. Olsen, G., H. Matsuda, R. Hagstrom, and R. Overbeek. 1994. fastDNAml: a tool for construction of phylogenetic trees of DNA sequences using maximum likelihood. Comput. Appl. Biosci. 10:41-48.
16. Ota, S., and W. Li. 2000. NJML: a hybrid algorithm for the neighbor-joining and maximum likelihood methods. Mol. Biol. Evol. 17:1401-1409.
17. Pachter, L., and D. Speyer. 2004. Reconstructing trees from subtree weights. Appl. Math. Lett. 17:615-621.
18. Ranwez, V., and O. Gascuel. 2002. Improvement of distance-based phylogenetic methods by a local maximum likelihood approach using triplets. Mol. Biol. Evol. 19: 1952-1956.
19. Saitou, N., and M. Nei. 1987. The neighbor joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4:406-425.
20. Semple, C., and M. Steel. 2003. Phylogenetics. Oxford lecture series in mathematics and its applications, Vol. 24. Oxford University Press, Oxford.
21. Studier, J., and K. Keppler. 1988. A note on the neighbor-joining method of Saitou and Nei. Mol. Biol. Evol. 5:729-731.