Performance study of phylogenetic methods: (Unweighted) quartet methods and neighbor-joining

Journal of Algorithms

Volumn 48, Issue 1, 2003, Pages 173-193

  St John, Katherine ^a   Warnow, Tandy ^b   Moret, Bernard M E ^c   Vawter, Lisa ^d  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b University of Texas at Austin   (United States)

^c MSC01 1070   (United States)

^d NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; TREES (MATHEMATICS);

PHYLOGENETIC METHODS;

COMPUTER SCIENCE;

EID: 0041928191     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00049-X     Document Type: Conference Paper

References (31)

1. K. Atteson, The performance of the neighbor-joining method of phylogeny reconstruction, Algorith- mica 25 (2-3) (1999) 251-278.
2. V. Berry, D. Bryant, T. Jiang, P. Kearney, M. Li, T. Wareham, H. Zhang, A practical algorithm for recovering the best supported edges of an evolutionary tree, in: Proc. 11th Ann. ACM-SIAM Symp. Discrete Algs. SODA 2000, SIAM Press, 2000, pp. 287-296.
3. V. Berry, O. Gascuel, Inferring evolutionary trees with strong combinatorial evidence, Theoret. Comput. Sci. 240 (2) (2000) 271-298.
4. V. Berry, T. Jiang, P. Kearney, M. Li, T. Wareham, Quartet cleaning: improved algorithms and simulations, in: Proc. Europ. Symp. Algs., ESA99, in: Lecture Notes in Comput. Sci., Vol. 1643,1999, pp. 313-324.
5. J.K. Chambers, L.E. Macdonald, H.M. Sarau, R.S. Ames, K. Freeman, J.J. Foley, Y. Zhu, M.M. McLaughlin, P. Murdock, L. McMillan, J. Trill, A. Swift, N. Aiyar, P. Taylor, L. Vawter, S. Nahed, P. Szekeres, G. Hervieu, C. Scott, J.M. Watson, A.J. Murphy, E. Duzic, C. Klein, DJ. Bergsma, S. Wilson, G.P. Livi, A G protein-coupled receptor for Uridine 5′-diphosphoglucose (UDP-glucose), J. Biol. Chem. 275 (2000) 10767-10771.
6. R. Durbin, S. Eddy, A. Krogh, G. Mitchison, Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids, Cambridge Univ. Press, 1988.
7. P.L. Erdös, M. Steel, L. Székély, T. Warnow, A few logs suffice to build almost all trees - I, Random Structures Algorithms 14 (1997) 153-184.
8. J. Felsenstein, Evolutionary trees from DNA sequences: A maximum likelihood approach, J. Mol. Evol. 17 (1981) 368-376.
9. D.M. Hillis, Approaches for assessing phylogenetic accuracy, Syst. Biol. 44 (1995) 3-19.
10. D.M. Hillis, J.J. Bull, M.E. White, M.R. Badgett, I.J. Molineux, Experimental phylogenies: generation of a known phylogeny, Science 255 (1992) 589-592.
11. D.M. Hillis, C. Moritz, B. Mable, Molecular Systematics, Sinauer, Boston, 1996.
12. J. Huelsenbeck, D. Hillis, Success of phylogenetic methods in the four-taxon case, Syst. Biol. 42 (3) (1993) 247-264.
13. D. Huson, S. Nettles, K. Rice, T. Warnow, S. Yooseph, The hybrid tree reconstruction method, ACM J. Exp. Algorithms 4 (5) (1999), http://www.jea.acm.org/1999/HusonHybrid/.
14. D. Huson, S. Nettles, T. Warnow, Disk-covering, a fast converging method for phylogenetic tree reconstruction, J. Comp. Biol. 6 (1999) 369-386.
15. T. Jiang, P.E. Kearney, M. Li, A polynomial-time approximation scheme for inferring evolutionary trees from quartet topologies and its application, SIAM J. Comput. 30 (6) (2001) 1942-1961.
16. T.H. Jukes, C. Cantor, Mammalian Protein Metabolism, Academic Press, New York, 1969, pp. 21-132.
17. P.J. Keeling, M.A. Luker, J.D. Palmer, Evidence from beta-tubulin phylogeny that microsporidia evolved from within the Fungi, Mol. Biol. Evol. 17 (2000) 23-31.
18. M. Kimura, A simple method for estimating evolutionary rate of base substitutions through comparative studies of nucleotide sequences, J. Mol. Evol. 16 (1980) 111-120.
19. C.C. McGeoch, Analyzing algorithms by simulation: variance reduction techniques and simulation speedups, ACM Comput. Surveys 24 (1992) 195-212.
20. B. Mishof, C.L. Anderson, H. Hadrys, A phylogeny of the damselfly genus Calopteryx (Odonata) using mitochondrial 16s rDNA markers, Molecular Phylog. Evol. 15 (2000) 5-14.
21. B.M.E. Moret, Towards a discipline of experimental algorithmics, in: M. Goldwasser, D.S. Johnson, C.C. McGeoch (Eds.), Proc. 5th & 6th DIMACS Implementation Challenges, American Mathematical Society, Providence, 2003, available at http://www.cs.unm.edu/̃moret/dimacs.ps.
22. G.J. Olsen, H. Matsuda, R. Hagstrom, R. Overbeek, fastDNAml: A tool for construction of phylogenetic trees of DNA sequences using maximum likelihood, Comput. Appl. Biosci. 10 (1994) 41-48.
23. D. Penny, M.A. Steel, Distributions of tree comparison metrics - some new results, Syst. Biol. 42 (1993) 126-141.
24. A. Rambaut, N.C. Crassly, Seq-Gen: An application for the Monte Carlo simulation of DNA sequence evolution along phylogenetic trees, Comput. Appl. Biosci. 13 (1997) 235-238.
25. V. Ranwez, O. Gascuel, Quartet-based phylogenetic inference: improvements and limits, Mol. Biol. Evol. 18 (6) (2001) 1103-1116.
26. F. Rodrigues-Trelles, L. Alarcon, A. Fontdevila, Molecular evolution and phylogeny of the buzzatü complex (D. repleta group): a maximum likelihood approach, Mol. Biol. Evol. 17 (2000) 1112-1122.
27. N. Saitou, M. Nei. The neighbor-joining method: A new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4 (1987) 406-425.
28. K. Strimmer, A. von Haeseler, Quartet puzzling: a maximum likelihood method for reconstructing tree topologies, Mol. Biol. Evol. 13 (1996) 964-969.
29. J.A. Studier, K.J. Keppler, A note on the neighbor-joining method of Saitou and Nei, Mol. Biol. Evol. 5 (1981) 729-731.
30. P.C. Szekeres, A.I. Muir, L.D. Spinage, J.E. Miller, S.I. Butler, A. Smith, G.I. Rennie, P.R. Murdock, L.R. Fitzgerald, H. Wu, L.J. McMillan, S. Guerrera, L. Vawter, N.A. Elshourbagy, J.L. Mooney, D.J. Bergsma, S. Wilson, J.K. Chambers, Neuromedin U is a potent agonist at the orphan G protein coupled receptor FM3, J. Biol. Chem. 275 (2000) 20247-20250.
31. S.J. Willson, An error-correcting map for quartest can improve the signals for phylogenetic trees, Mol. Biol. Evol. 18 (3) (2001) 344-351.