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

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 333-340

  Henzinger, Monika Rauch ^a   King, Valerie ^b   Warnow, Tandy ^c  

^a Cornell University ^*  (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

ALGORITHMS; BINARY TREES; BIOLOGY; COMPUTATION THEORY; DATA STRUCTURES; GRAPH THEORY; MAXIMUM LIKELIHOOD; PROBLEM SOLVING; TREES (MATHEMATICS);

COMPUTATIONAL EVOLUTIONARY BIOLOGY; CONSENSUS TREES; DETERMINISTIC ALGORITHMS; EVOLUTIONARY BIOLOGY; EVOLUTIONARY TREE; LOCAL CONSENSUS; RANDOMIZED ALGORITHMS; SIMPLE ALGORITHM;

EVOLUTIONARY ALGORITHMS;

EID: 85002013940     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. 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 J. of Computing, Vol 10, No. 3, 1981, pp. 405-421.
2. A. Amir and D. Keselman, Maximum agreement subtree in a set of evolutionary trees - metrics and efficient algorithms, FOCS '94.
3. J.P. Barthelemy, and F.R. McMorris, The median procedure for n-trees, Journal of Classification 3, pp. 329-334, 1986.
4. W.H.E. Day, Optimal algorithms for comparing trees with labelled leaves, Journal of Classification 2, pp. 7-28, 1985.
5. D. Eppstein, Z. Galil, and G. F. Italiano. Improved Sparsification, Tech. Report 93-20, Department of Information and Computer Science, University of California, Irvine, CA 92717.
6. S. Even and Y. Shiloach, An on-line edge deletion problem, J. ACM, Vol. 28, No. 1 (1981), pp. 1-4.
7. M. Farach, S. Kannan and T. Warnow, A Robust Model for Finding Optimal Evolutionary Trees, Algorithmica, special issue on Computational Biology, Vol. 13, No. 1, 1995, pp. 155-179.
8. M. Farach, T. Przytycka, and M. Thorup, On the agreement of many trees, Information Processing Letters, to appear.
9. J. Felsenstein, Numerical methods for inferring evolutionary trees, The Quarterly Review of Biology, Vol. 57, No. 4, (1982), pp. 379-404.
10. G. N. Frederickson, Data Structures for On-line Updating of Minimum Spanning Trees SIAM J. Comput. 14:781-798, 1985.
11. D. Gusfield, Efficient algorithms for inferring evolutionary trees, Networks 21, pp. 19-28, 1991.
12. M. Henzinger and V. King, Randomized Dynamic Algorithms with Polylogarithmic Time per Operation, Proceedings, STOC '95.
13. S. Kannan, E. Lawler, and T. Warnow, Determining the Evolutionary Tree, to appear, Journal of Algorithms.
14. S. Kannan and T. Warnow, A fast algorithm to find and enumerate perfect phytogenies, Proceedings, SODA '95.
15. S. Kannan, T. Warnow, and S. Yooseph, Computing the local consensus of trees, Proceedings, SODA '95.
16. R.D.M. Page, Genes, Organisms and Areas: The problem of multiple lineages, Systematic Biology 42(1), pp. 77-84, 1993.
17. M. Steel and T. Warnow, Kaikoura Tree Theorems: Computing the maximum agreement subtree, Information Processing Letters 48, pp. 72-82, 1993.
18. T. Warnow, Tree Compatibility and Inferring Evolutionary History, Journal of Algorithms, 16, pp. 388-407, 1994.