A few logs suffice to build (almost) all trees: Part II

Theoretical Computer Science

Volumn 221, Issue 1-2, 1999, Pages 77-118

  Erdos, Péter L ^a   Steel, Michael A ^b   Székely, László A ^c   Warnow, Tandy J ^d  

^a ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

^b UNIVERSITY OF CANTERBURY   (New Zealand)

^c UNIVERSITY OF SOUTH CAROLINA   (United States)

^d UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Distance based methods; Dyadic closure method; Evolutionary tree reconstruction; Phylogeny; Quartet methods; Short quartet methods; Witness antiwitness method

Indexed keywords

EID: 0001860411     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00028-6     Document Type: Article

References (64)

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 Annual ACM-SIAM Symp. on Discrete Algorithms, 1996, pp. 365-372.
2. D.J. Aldous, Probability distributions on cladograms, in: D.J. Aldous, R. Permantle (Eds.), Discrete Random Structures, IMA Volume in Mathematics and its Applications, 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: 38th Annual Symp. on Foundations of Computer Science, Miami Beach, FL, 20-22 October 1997. IEEE Science, New York, pp. 524-533.
5. K. Atteson, The performance of neighbor-joining algorithms of phylogeny reconstruction, in: Computing and Combinatorics, 3rd Annual Internat. Conf., COCOON'97, Shanghai, China, August 1997, COCOON'97, Lecture Notes in Computer Science, vol. 1276, Springer, Berlin, 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. V. Berry, O. Gascuel, Inferring evolutionary trees with strong combinatorial evidence, in: Computing and Combinatorics, 3rd Annual Internat. Conf., COCOON'97, Shanghai, China, August 1997, COCOON'97, Lecture Notes in Computer Science, vol. 1276, Springer, Berlin, pp. 111-123.
8. J.K.M. Brown, Probabilities of evolutionary trees, Syst. Biol. 43 (1994) 78-91.
9. D.J. Bryant, M.A. Steel, Extension operations on sets of leaf-labelled trees, Adv. Appl. Math. 16 (1995) 425-453.
10. P. Buneman, The recovery of trees from measures of dissimilarity, in: F.R. Hodson, D.G. Kendall, P. Tautu (Eds.), Mathematics in the Archaeological and Historical Sciences, Edinburgh University Press, Edinburgh, 1971, pp. 387-395.
11. M. Carter, M. Hendy, D. Penny, L.A. Székely, N.C. Wormald, On the distribution of lengths of evolutionary trees, SIAM J. Discrete Math. 3 (1990) 38-47.
12. J.A. Cavender, Taxonomy with confidence, Math. Biosci. 40 (1978) 271-280.
13. J.T. Chang, J.A. Hartigan, Reconstruction of evolutionary trees from pairwise distributions on current species, in: Computing Science and Statistics: Proc. 23rd Symp. on the Interface, 1991, pp. 254-257.
14. H. Colonius, H.H. Schultze, Tree structure for proximity data, Br. J. Math. Statist. Psychol. 34 (1981) 167-180.
15. M. Cryan, L.A. Goldberg, P.W. Goldberg, Evolutionary trees can be learned in polynomial time in the two-state general Markov-model, in: Proc. 39th Annual IEEE Symp. on Foundations of Computer Science, 1998, pp. 436-445.
16. M. Csuros, M.-Y. Kao, Fast reconstruction of evolutionary trees through Harmonic Greedy Triplets, in: Proc. ACM-SIAM Symp. on Discrete Algorithms, 1999, pp. 261-268.
17. W.H.E. Day, Computational complexity of inferring phylogenies from dissimilarities matrices, Inform. Process. Lett. 30 (1989) 215-220.
18. P.L. Erdos, M.A. Steel, L.A. Székely, T. Warnow, Local quartet splits of a binary tree infer all quartet splits via one dyadic inference rule, Comput. Artif. Intell. 16 (2) (1997) 217-227.
19. P.L. Erdos, M.A. Steel, L.A. Székely, T. Warnow, Inferring big trees from short quartets, in: ICALP'97, 24th Internat. Colloquium on Automata, Languages, and Programming, Silver Jubilee of EATCS, Bologna, Italy, July 7-11, 1997, Lecture Notes in Computer Science, vol. 1256, Springer, Berlin, 1997, pp. 1-11.
20. P.L. Erdos, M.A. Steel, L.A. Székely, T. Warnow, A few logs suffice to build (almost) all trees (I), Random Struct. Algorithms 14 (1999) 153-184.
21. M. Farach, J. Cohen, Numerical taxonomy on data: experimental results, in: Proc. ACM-SIAM Symp. on Discrete Algorithms, 1997.
22. M. Farach, S. Kannan, Efficient algorithms for inverting evolution, in: Proc. ACM Symp. on the Foundations of Computer Science, 1996, pp. 230-236.
23. M. Farach, S. Kannan, T. Warnow, A robust model for inferring optimal evolutionary trees, Algorithmica 13 (1995) 155-179.
24. J.S. Farris, A probability model for inferring evolutionary trees, Syst. Zool. 22 (1973) 250-256.
25. J. Felsenstein, Cases in which parsimony or compatibility methods will be positively misleading, Syst. Zool. 27 (1978) 401-410.
26. J. Felsenstein, Numerical methods for inferring evolutionary trees, Quart. Rev. Biol. 57 (1982) 379-404.
27. D. Feng, R. Doolittle, Progressive sequence alignment as a prerequisite to correct phylogenetic trees, J. Mol. Evol. 25 (1987) 351-360.
28. Green Plant Phylogeny Research Coordination Group, Summary Report of Workshop #1: Current Status of the Phylogeny of the Charophyte Green Algae and the Embryophytes (University and Jepson Herbaria, University of California, Berkeley, June 24-28, 1995), 1996.
29. E.F. Harding, The probabilities of rooted tree shapes generated by random bifurcation, Adv. Appl. Probab. 3 (1971) 44-77.
30. J. Hein, A new method that simultaneously aligns and reconstructs ancestral sequences for any number of homologous sequences, when the phylogeny is given, Mol. Biol. Evol. 6 (1989) 649-668.
31. D. Hillis, Approaches for assessing phylogenetic accuracy, Syst. Biol. 44 (1995) 3-16.
32. D. Hillis, Inferring complex phylogenies, Nature 383 (1996) 130-131.
33. P. Hogeweg, B. Hesper, The alignment of sets of sequences and the construction of phylogenetic trees, an integrated method, J. Mol. Evol. 20 (1984) 175-186.
34. J. Huelsenbeck, Performance of phylogenetic methods in simulation, Syst. Biol. 44 (1995) 17-48.
35. J.P. Huelsenbeck, D. Hillis, Success of phylogenetic methods in the four-taxon case, Syst. Biol. 42 (1993) 247-264.
36. D. Huson, S. Nettles, T. Warnow, Inferring very large evolutionary trees from very short sequences, Proc., RECOMB, 1999.
37. T. Jiang, E. Lawler, L. Wang, Aligning sequences via an evolutionary tree: complexity and approximation ACM STOC'94.
38. S. Kannan, personal communication.
39. M. Kimura, Estimation of evolutionary distances between homologous nucleotide sequences, Proc. Natl. Acad. Sci. USA 78 (1981) 454-458.
40. J. Neyman, Molecular studies of evolution: a source of novel statistical problems, in: S.S. Gupta, J. Yackel (Eds.), Statistical Decision Theory and Related Topics, Academic Press, New York, 1971, pp. 1-27.
41. K. Rice, personal communication.
42. K. Rice, T. Wamow, Parsimony is hard to beat, in: T. Jiang, D.T. Lee (Eds.), COCOON'97, Computing and Combinatorics, 3rd Annual Internat. Conf., Shanghai, August 20-22, 1997, Lecture Notes in Computer Science, vol. 1276, Springer, Berlin, pp. 124-133.
43. N. Saitou, M. Nei, The neighbor-joining method: a new method for reconstructing phylogenetic trees, Mol. Biol. Evol. 4 (1987) 406-425.
44. N. Saitou, T. Imanishi, Relative efficiencies of the Fitch-Margoliash, maximum parsimony, maximum likelihood, minimum evolution, and neighbor-joining methods of phylogenetic tree construction in obtaining the correct tree, Mol. Biol. Evol. 6 (1987) 514-525.
45. Y.A. Smolensky, A method for linear recording of graphs, USSR Comput. Math. Phys. 2 (1969) 396-397.
46. M.A. Steel, The complexity of reconstructing trees from qualitative characters and subtrees, J. Classification 9 (1992) 91-116.
47. M.A. Steel, Recovering a tree from the leaf colourations it generates under a Markov model, Appl. Math. Lett. 7 (1994) 19-24.
48. M. Steel, M.D. Hendy, D. Penny, Reconstructing phylogenies from nucleotide pattern probabilities: a survey and some new results, Discrete Appl. Math. 89 (1999) 367-396.
49. M.A. Steel, L.A. Székely, M.D. Hendy, Reconstructing trees when sequence sites evolve at variable rates, J. Comput. Biol. 1 (1994) 153-163.
50. K. Strimmer, A. von Haeseler, Quartet Puzzling: a quartet Maximum Likelihood method for reconstructing tree topologies, Mol. Biol. Evol. 13 (1996) 964-969.
51. K. Strimmer, N. Goldman, A. von Haeseler, Bayesian probabilities and Quartet Puzzling, Mol. Biol. Evol. 14 (1997) 210-211.
52. D.L. Swofford, G.J. Olsen, P.J. Waddell, D.M. Hillis, Phylogenetic inference, Ch. 11, in: D.M. Hillis, C. Moritz, B.K. Mable (Eds.), Molecular Systematics, 2nd ed., Sinauer Associates, Inc., Sunderland, 1996, pp. 407-514.
53. D. Harel, R.E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput. 13 (1984) 338-355.
54. N. Takezaki, M. Nei, Inconsistency of the maximum parsimony method when the rate of nucleotide substitution is constant, J. Mol. Evol. 39 (1994) 210-218.
55. L. Vawter, W. Brown, Nuclear and mitochondrial DNA comparisons reveal extreme rate variation in the molecular clock, Science 234 (1986) 194-196.
56. L. Vawter, W. Brown, Rates and patterns of base change in the small subunit ribosomal RNA gene, Genetics 134 (1993) 597-608.
57. L. Wang, D. Gusfield, Improved approximation algorithms for tree alignment, J. Algorithms 25 (1997) 255-273.
58. L. Wang, T. Jiang, On the complexity of multiple sequence alignment, J. Comput. Biol. 1 (1994) 337-348.
59. L. Wang, T. Jiang, E. Lawler, Approximation algorithms for tree alignment with a given phylogeny, Algorithmica 16 (1996) 302-315.
60. L. Wang, T. Jiang, D. Gusfield, A more efficient approximation scheme for tree alignment, in: Proc. 1st Annual Internat. Conf. on Computational Molecular Biology, January 1997, Santa Fe, NM, USA.
61. T. Warnow, Combinatorial algorithms for constructing phylogenetic trees, Ph.D. Thesis, University of California-Berkeley, 1991.
62. M.S. Waterman, T.F. Smith, M. Singh, W.A. Beyer, Additive evolutionary trees, J. Theoret. Biol. 64 (1977) 199-213.
63. A.C. Wilson, R.L. Cann, The recent African genesis of humans, Scientific Amer. 266 (1992) 68-73.
64. K.A. Zaretsky, Reconstruction of a tree from the distances between its pendant vertices, Uspekhi Math. Nauk (Russian Mathematical Surveys) 20 (1965) 90-92 (in Russian).