Neighbor joining algorithms for inferring phylogenies via LCA distances

Journal of Computational Biology

Volumn 14, Issue 1, 2007, Pages 1-15

  Gronau, Ilan ^a   Moran, Shlomo ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Algorithms; Phylogenetic analyses; Phylogenetic trees

Indexed keywords

ALGORITHM; ARTICLE; CLUSTER ANALYSIS; MATHEMATICAL ANALYSIS; NEIGHBOR JOINING METHOD; PHYLOGENETIC TREE; PHYLOGENY; PRIORITY JOURNAL; TAXONOMY;

ALGORITHMS; EVOLUTION, MOLECULAR; MODELS, GENETIC; PHYLOGENY;

EID: 34047218292     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2006.0115     Document Type: Article

References (36)

1. Agarwala, R. Bafna, V. Farach, M. et al. 1999. On the approximability of numerical taxonomy (fitting distances by tree metrics). SIAM J. Comput. 28, 1073-1085.
2. Atteson, K. 1999. The performance of neighbor-joining methods of phylogenetic reconstruction. Algorithmica 25 251-278.
3. Bartal, Y. Linial, N. Mendel, M. et al. 2004. Low dimensional embeddings of ultrametrics. Eur. J. Comb. 25, 87-92.
4. Barthelemy, J. and Guenoche, A. 1991. Trees and Proximities Representations. Wiley, New York.
5. Berry, V. and Bryant, D. 1999. Faster reliable phylogenetic analysis. RECOMB'99 59-68.
6. Brodal, G. Fagerberg, R. Pedersen, C. et al. 2001. The complexity of constructing evolutionary trees using experiments. Lect. Notes Comput. Sci. 2076, 140-151.
7. Bruno, W. Socci, N. and Halpern, A. 2000. Weighted neighbor joining: a likelihood-based approach to distance-based phylogeny reconstruction. Mol. Biol. Evol. 17, 189-197.
8. Bryant, D. 2005. On the uniqueness of the selection criterion in neighbor-joining. J. Classification 22, 3-15.
9. Buneman, P. 1971. The recovery of trees from measures of dissimilarity. In: Mathematics in the Archeological and Historical Sciences, Edinbourgh University Press, pg. 387-395.
10. Jaffe, A. Mihaescu, R. Mossel, E. et al. 2006. Maximal accurate forests from distance matrices. RECOMB'06 281-295.
11. Culberson, J. and Rudnicki, P. 1989. A fast algorithm for constructing trees from distance matrices. Inform. Process. Lett. 30, 215-220.
12. Warnow, T. Huson, D. and Nettles, S. 1999. Disk-Covering, a fast-converging method for phylogenetic tree reconstruction. J. Comput. Biol. 6, 369-386.
13. Day, W. 1987. Computational complexity of inferring phylogenies from dissimilarity matrices. Bull. Math. Biol. 49, 461-467.
14. Desper, R. and Gascuel, O. 2002. Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle. J. Comput. Biol. 5, 687-705.
15. Elias, I. and Lagergren, J. 2005. Fast neighbor joining. Lect. Notes Comput. Sci. 3580, 1263-1274.
16. Erdos, P. Steel, M. Szekely, L. et al. 1999. A few logs suffice to build (almost) all trees (II). Theoret. Comput. Sci. 221, 77-118.
17. Farach, M. Kannan, S. and Warnow, T. 1995. A robust model for finding optimal evolutionary trees. Algorithmica 13, 155-179.
18. Farris, J. 1973. A probability model for inferring evolutionary trees. Systematic Zool. 22, 250-256.
19. Felsenstein, J. 1981. Evolutionary trees from DNA sequences: a maximum likelihood approach. J. Mol. Evol. 17, 368-376.
20. Gascuel, O. 1997. BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data. Mol. Biol. Evol. 14, 685-695.
21. Gascuel, O. and Guindon, S. 2006. The methods and algorithms in bioinformatics (MAB) lab. Le Laboratoire d'Informatique, de Robotique et de Microlectronique de Montpellier. Available at: http:/www.lirmm.fr/mab/ sommaire.english.php3. Accessed November 15, 2006.
22. Gronau, I. and Moran, S. 2006a. Optimal implementations of UPGMA and other common clustering algorithms, submitted.
23. Gronau, I. and Moran, S. 2006b. Pivotal neighbor joining algorithms for inferring phylogenies via LCA-distances. Technical Report CS-2006-11, Technion. Available at: http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-get.cgi/ 2006/CS/CS-2006-11.pdf. Accessed November 15, 2006.
24. Gusfield, D. 1997. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge.
25. Kannan, S. Lawler, E. and Warnaw, T. 1996. Determining the evolutionary tree using experiments. J. Algorithms 21, 26-50.
26. Krivanek, M. 1988. The complexity of ultrametric partitions on graphs. Inform. Process. Lett. 27, 265-270.
27. Levy, D. Yoshida, R. and Pachter, L. 2005. Beyond pairwise distances: neighbor joining with phylogenetic diversity estimates. Mol. Biol. Evol. 23, 491-498.
28. Mihaescu, R. Levy, D. and Pachter, L. 2006. Why neighbor-joining works. Available at: http://www.arxiv.org/abs/cs.OS/0602041
29. Mossel, E. 2004. Phase transitions in phylogeny. Trans. Am. Math. Soc. 356, 2379-2404.
30. Ota, S. and Li, W. 2000. NJML: a hybrid algorithm for the neighbor-joining and maximum-likelihood methods. Mol. Biol. Evol. 17, 1401-1409.
31. Ranwez, V. and Gascuel, O. 2002. Improvement of distance-based phylogenetic methods by a local maximum likelihood approach using triplets. Mol. Biol. Evol. 19, 1952-1963.
32. Saitou, N. and Nei, M. 1987. The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4, 406-425.
33. Sattath, S. and Tversky, A. 1977. Additive similarity trees. Psychometrica 42, 319-345.
34. Sneath, P. and Sokal, R. 1973. Numerical Taxonomy: The Principles and Practice of Numerical Classification. W. H. Freeman, San Francisco.
35. Studier, J. and Keppler, K. 1988. A note on the neighbor-joining algorithm of Saitou and Nei. Mol. Biol. Evol. 5, 729-731.
36. Waterman, M. Smith, T. Singh, M. et al. 1977. Additive evolutionary trees. J. Theor. Biol. 64, 199-213.