Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology

Algorithmica (New York)

Volumn 24, Issue 1, 1999, Pages 1-13

  Henzinger, M R ^a   King, V ^b   Warnow, T ^c  

^a HEWLETT PACKARD COMPANY   (United States)

^b UNIVERSITY OF VICTORIA   (Canada)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Algorithms; Data structures; Evolutionary biology; Theory of databases

Indexed keywords

EID: 0013290962     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009268     Document Type: Article

References (31)

1. E. Adams III, Consensus techniques and the comparison of taxonomic trees. Systematic Zoology, 21 (1972), 390-397.
2. R. Agarwala, V. Bafna, M. Farach, B. Narayanan, M. Paterson, and M. Thorup, On the approximability of numerical taxonomy: fitting distances by tree metrics. Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 365-372, 1996.
3. A.V. Aho, Y. Sagiv, T.G. Szymanski, and J.D. Ullman. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions, SIAM Journal on Computing, 10(3) (1981), 405-421.
4. A. Amir and D. Keselman, Maximum agreement subtree in a set of evolutionary trees - metrics and efficient algorithms, SIAM Journal on Computing, 26(6) (1997), 1656-1669. A preliminary version appeared in FOCS 94.
5. K. Atteson, The performance of neighbor-joining algorithms of phylogeny construction, Proceedings, Computing and Combinatorics (COCOON), Lecture Notes in Computer Science, Vol. 1276, pp. 101-110, Springer-Verlag, Berlin, 1997.
6. J.P. Barthelemy and F.R. McMorris, The median procedure for n-trees, Journal of Classification, 3 (1986), 329-334.
7. D. Bryant, Building Trees, Hunting for Trees, and Comparing Trees (Theory and Methods in Phylogenetic Analysis), Ph.D. Thesis, Department of Mathematics, Canterbury University, Christchurch, New Zealand, 1997.
8. W.H.E. Day, Optimal algorithms for comparing trees with labelled leaves, Journal of Classification, 2 (1985), 7-28.
9. W.H.E. Day, D.S. Johnson, and D. Sankoff, The computational complexity of inferring rooted phylogenies by parsimony, Mathematical Biosciences, 81 (1986), 33-42.
10. W.H.E. Day and D. Sankoff, Computational complexity of inferring phylogenies by compatibility, Systematic Zoology, 35 (1986), 224-229.
11. M.J. Donoghue, Phylogenies and the analysis of evolutionary sequences, with examples from seed plants, Evolution, 43(6) (1989), 1137-1156.
12. D. Eppstein, Z. Galil, and G.F. Italiano, Improved Sparsitication, Tech. Report 93-20, Department of Information and Computer Science, University of California, Irvine, CA 92717.
13. P. Erdos, M. Steel, L. Szekely, and T. Warnow, A few logs suffice to build almost all trees, Proceedings, ICALP, 1997.
14. S. Even and Y. Shiloach, An on-line edge deletion problem, Journal of the Association for Computing Machinery, 28(1) (1981), 1-4.
15. M. Farach, S. Kannan, and T. Warnow, A robust model for finding optimal evolutionary trees, Algorithmica (special issue on Computational Biology), 13(1) (1995), 155-179.
16. M. Farach, T. Przytycka, and M. Thorup, On the agreement of many trees, Information Processing Letters, to appear.
17. J. Felsenstein, Numerical methods for inferring evolutionary trees, The Quarterly Review of Biology, 57(4) (1982), 379-404.
18. G. N. Frederickson, Data structures for on-line updating of minimum spanning trees, SIAM Journal on Computing, 14 (1985), 781-798.
19. D. Gusfield, Efficient algorithms for inferring evolutionary trees, Networks, 21 (1991), 19-28.
20. M. R. Henzinger and V. King, Randomized dynamic algorithms with polylogarithmic time per operation, Proceedings of the 27th Annual Symposium on Theory of Computing, pp. 519-527, 1995.
21. S. Kannan, E. Lawler, and T. Warnow, Determining the evolutionary tree, Journal of Algorithms, 21(1) (1996), 26-50.
22. S. Kannan and T. Warnow, A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed, SIAM Journal on Computing, 26(6) (1997), 1749-1763.
23. S. Kannan, T. Warnow, and S. Yooseph, Computing the local consensus of trees, Proceedings, SODA, 1995. Also, SIAM Journal on Computing, to appear.
24. M.Y. Kao, Tree contractions and evolutionary trees, SIAM Journal on Computing, No. 6 (1998), 1592-1616 (electronic).
25. M. Miyamoto and W. Fitch, Testing species phylogenies and phylogenetic methods with congruence, Systematic Biology, 44 (1995), 64-76.
26. G. Nelson, Cladistic analysis and synthesis: Principles and definitions, with a historical note on Adanson's Familles des Plantes (1763-1764), Systematic Zoology, 28 (1979), 1-21.
27. R.D.M. Page, Genes, organisms and areas: the problem of multiple lineages, Systematic Biology, 42(1) (1993), 77-84.
28. C. Phillips and T. Warnow, The asymmetric median tree: a new model for building consensus trees, Discrete Applied Mathematics (1997), 311-335.
29. K. Rice and T. Warnow, Parsimony is hard to beat!, Proceedings, Computing and Combinatorics (COCOON), Lecture Notes in Computer Science, Vol. 1276, pp. 124-133, Springer-Verlag, Berlin, 1997.
30. M. Steel and T. Warnow, Kaikoura tree theorems: computing the maximum agreement subtree, Information Processing Letters, 48 (1993), 72-82.
31. T. Warnow, Tree compatibility and inferring evolutionary history, Journal of Algorithms, 16 (1994), 388-407.