Inferring evolutionary trees with strong combinatorial evidence

Theoretical Computer Science

Volumn 240, Issue 2, 2000, Pages 271-298

  Berry, Vincent ^a   Gascuel, Olivier ^a  

^a LIRMM   (France)

Author keywords

Combinatorial technique; Exact polynomial algorithm; Experimental study; Partially resolved tree; Phylogeny reconstruction; Quartet method; Worst case convergence rate

Indexed keywords

EID: 0001117764     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00235-2     Document Type: Article

References (50)

1. R. Agarwala, V. Bafna, M. Farach, B. Narayanan, M. Paterson, M. Thorup, On the approximability of numerical taxonomy: fitting distances by tree metrics, in: Proc. 7th ACM-SIAM SODA, 1996.
2. D.J. Aldous, Probability distributions on cladograms, in: Mathematics and its Application, IMA, vol. 76, Springer, Berlin, 1995, pp. 1-18.
3. N. Alon , J.H. Spencer, The Probabilistic Method, Wiley, New York, 1992.
4. A. Ambainis, R. Desper, M. Farach, S. Kannan, Nearly tight bounds on the learnability of evolution, in: IEEE Symp. on Foundations of Computer Science, 1998.
5. K. Atteson, The performance of neighbor-joining algorithms of phylogeny reconstruction, in: Proc. COCOON, Computing and Combinatorics, Springer, Berlin, 1997, pp. 101-110.
6. H.-J. Bandelt, A. Dress, Reconstructing the shape of a tree from observed dissimilarity data, Adv. Appl. Math. 7 (1986) 309-343.
7. H.-J. Bandelt, A. Dress, A canonical decomposition theory for metrics on a finite set, Adv. Math. 92 (1992) 47-105.
8. J.P. Barthélemy, A. Guénoche, Trees and Proximities Representations, Wiley, New York, 1991.
9. V. Berry, Méthodes et Algorithmes pour reconstruire les arbres de l'Évolution, Ph.D. Thesis, Université de Montpellier, France, 1997.
10. V. Berry, D. Bryant, Faster reliable phylogenetic analysis, Proc. RECOMB'99, pp. 59-68, ACM Press, 1999.
11. V. Berry, O. Gascuel, On the interpretation of bootstrap trees: appropriate threshold of clade selection and induced gain, Mol. Biol. Evol. 13(7) (1996) 999-1011.
12. V. Berry, O. Gascuel, Reconstructing phylogenies from resolved 4-trees, Tech. Rep. 97076, LIRMM, 1997.
13. D. Bryant, V. Moulton, A polynomial time algorithm for constructing the refined buneman tree, Appl. Math. Lett. 12 (1999) 51-56.
14. P. Buneman, The recovery of trees from measures of dissimilarity, in: Mathematics in Archeological and Historical Sciences, Edhinburgh University Press, 1971, pp. 387-395.
15. P. Buneman, A note on metric properties of trees, J. Combin. Theory 17(B) (1974) 48-50.
16. J.A. Cavender, Taxonomy with confidence, Math. Biosci. 40 (1978) 271-280.
17. V. Chepoi, B. Fichet, L∞ approximation via subdominants, J. Math. Psychol. (1999), to appear.
18. H. Colonius, H.H Schulze, Tree structures for proximity data, British J. Math. Statist. Psycho. 34 (1981) 167-180.
19. W.H.E. Day, Computational complexity of inferring phylogenies from dissimilarity matrices, Bull. Math. Biol. 49 (1987) 461-467.
20. W.H.E. Day, D. Sankoff, Computational complexity of inferring phylogenies by compatibility, Syst. Zool. 35(2) (1986) 224-229.
21. A.M. d'Erchia, C. Gissi, G. Pesole, C. Saccone, U. Arnason, The guinea-pig is not a rodent, Nature 381 (1996) 597-600.
22. P.L. Erdös, M.A. Steel, L.A. Szkely, T.J. Wamow, Constructing big trees from short sequences, in: 24th Internat. Colloquium on Automata Languages and Programming, 1997.
23. M. Farach, S. Kannan, Efficient algorithms for inverting evolution, in: Proc. 28th Ann. ACM Symp. on Theory of Computing, 1996, pp. 230-236.
24. J.S. Farris, A probability model for inferring evolutionary trees, Syst. Zool. 22 (1973) 250-256.
25. J. Felsenstein, Cases in which parsimony and compatibility methods will be positively misleading, Syst. Zool. 27 (1978) 401-410.
26. J. Felsenstein, Phylogenies from molecular sequences: inference and reliability, Annu. Rev. Genet. 22 (1988) 521-565.
27. J. Felsenstein, Phylip (phylogeny inference package) version 3.5c, Department of Genetics, University of Washington, Seattle, 1993.
28. O. Gascuel, D. Levy, A reduction for approximating a (non-metric) dissimilarity by a tree distance, J. Classification 13 (1996) 129-155.
29. D. Graur, W.A. Hide, W.-H. Li, Is the guinea-pig a rodent?, Nature 351 (1991) 649-652.
30. D. Gusfield, Efficient algorithms for inferring evolutionnary trees, Networks 21 (1991) 19-28.
31. E.F. Harding, The probabilities of rooted tree shapes generated by random bifurcation, Adv. Appl. Math. 3 (1971) 44-77.
32. W. Hoeffding, Probability inequalities for sums of bounded random variables, J. Amer. Statist. Assoc. 58 (1963) 13-30.
33. D.M. Hillis, J.P. Huelsenbeck, Success of phylogenetic methods in the four-taxon case, Syst. Biol. 42(3) (1993) 247-264.
34. T.H. Jukes, C.R. Cantor, Evolution of protein molecules, in: H.N. Munro (Ed.), Mammalian Protein Metabolism, vol. III, Ch. 24, Academic Press, New York, 1969, pp. 21-132.
35. P. Kearney, Ordinal beats additive, in: Second Annual Internat. Conf. on Computational Molecular Biology (RECOMB), 1998.
36. M. Kimura, A simple method for estimating evolutionary rates base substitutions through comparative studies of nucleotide sequences, J. Mol. Evol. 16 (1980) 111-120.
37. M.K. Kuhner, J. Felsenstein, A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates, Mol. Biol. Evol. 11 (1994) 459-468.
38. S. Kumar, A stepwise algorithm for finding minimum evolution trees, Mol. Biol. Evol. 13 (1996) 584-593.
39. G. Lecointre, H. Philippe, H.L.V. L, H. Le Guyader, Species sampling has a major impact on phylogenetic inference, Mol. Phylogenet. Evol. 2 (1993) 205-224.
40. C. Meacham, A manual method for character compatibility, Taxon 30 (1981) 591-600.
41. V. Moulton, M. Steel, Retractions of finite distance functions onto tree metrics, Discrete Appl. Math. 91(1-3) (1999) 215-233.
42. M. Nei, Relative efficiencies of different tree-making methods for molecular data, in: M.M. Miyamoto, J. Cracraft (Eds.), Phylogenetic Analysis of DNA Sequences, Oxford Univ. Press, Oxford, 1991.
43. D. Penny, M.D. Hendy, M.A. Steel, Testing the theory of descent, in: M.M. Miyamoto, J. Cracraft (Eds.), Phylogenetic Analysis of DNA Sequences, Oxford University Press, 1991, pp. 155-183.
44. N. Saitou, M. Nei, The neighbor-joining method: a new method for reconstruction phylogenetic trees, Mol. Biol. Evol. 4(4) (1987) 406-425.
45. S. Sattah, A. Tversky, Additive similarity trees, Psychom. 42 (1977) 319-345.
46. M. Steel, The complexity of reconstructing trees from qualitative characters and subtrees, J. Classification 9 (1992) 91-116.
47. K. Strimmer, A. von Haeseler, Quartet puzzling: a quartet maximum-likelihood method for reconstructing tree topologies, Mol. Biol. Evol. 13(7) (1996) 964-969.
48. D.L. Swofford, G.J. Olsen, P.J. Wadell, D.M. Hillis, Phylogenetic inference, in: Molecular Systematics, 2nd ed., Sunderland, USA, 1996, pp. 407-514.
49. F. Tajima, M. Nei, Estimation of evolution distance between nucleotide sequences, Mol. Biol. Evol. 1(3) (1984) 269-285.
50. T. Warnow, Personal communication, 1997.