Balanced randomized tree splitting with applications to evolutionary tree constructions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1563, Issue , 1999, Pages 184-196

  Kao, Ming Yang ^a   Lingas, Andrzej ^b   Östlin, Anna ^b  

^a Yale University   (United States)

^b LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; BINARY TREES;

DISTANCE MATRICES; EVOLUTIONARY TREE; LOWER BOUNDS; MAXIMUM AGREEMENT SUBTREES; NEW RESULTS; OPTIMAL SOLUTIONS; RANDOMIZED TREES; UPPER TIME BOUNDS;

TREES (MATHEMATICS);

EID: 84957059560     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49116-3_17     Document Type: Conference Paper

References (13)

1. J. C. Culbertson and P. Rudnicki. A fast algorithm for constructing trees from distance matrices. Information Processing Letters, 30(4):215-220, 1989.
2. M. Farach, S. Kannan, and T. J. Warnow. A robust model for finding optimal evolutionary trees. Algorithmica, 13(1/2):155-179, 1995.
3. M. Farach, T. M. Przytycka, and M. Thorup. Computing the agreement of trees with bounded degrees. In P. Spirakis, editor, Lecture Notes in Computer Science 979: Proceedings of the Third Annual European Symposium on Algorithms, pages 381-393. Springer-Verlag, New York, NY, 1995.
4. M. Farach and M. Thorup. Fast comparison of evolutionary trees (extended abstract). In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 481-488, 1994.
5. C. R. Finden and A. D. Gordon. Obtaining common pruned trees. Journal of Classification, 2:255-276, 1985.
6. L. Gąasieniec, J. Jansson, A. Lingas, and A. Östlin. On the complexity of computing evolutionary trees. In Lecture Notes in Computer Science 1276: Proceedings of the 3rd Annual International Computing and Combinatorics Conference, pages 134-145, 1997.
7. M. R. Henzinger, V. King, and T. J. Warnow. Constructing a tree from homeomorphic subtrees, with applications to computational biology. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 333-340, 1996.
8. S. K. Kannan, E. L. Lawler, and T. J. Warnow. Determining the evolutionary tree using experiments. Journal of Algorithms, 21:26-50, 1996.
9. M. Y. Kao. Tree contractions and evolutionary trees. SIAM Journal on Computing, 1998. To appear.
10. th Annual ACM Symposium on Theory of Computing, pages 54-65, 1997.
11. D. Keselman and A. Amir. Maximum agreement subtree in a set of evolutionary trees - metrics and eficient algorithms. In Proceedings of the 35th Annual IEEE Symposium on the Foundations of Computer Science, pages 758-769, 1994. To appear in SIAM Journal on Computing.
12. C. Phillips and T. J. Warnow. The asymmetric median tree - a new model for building consensus trees. In Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching, pages 234-252, 1996.
13. M. Steel and T. J. Warnow. Kaikoura tree theorems: Computing the maximum agreement subtree. Information Processing Letters, 48:77-82, 1993.