Cavity matchings, label compressions, and unrooted evolutionary trees

SIAM Journal on Computing

Volumn 30, Issue 2, 2000, Pages 602-624

  Kao, Ming Yang ^a   Lam, Tak Wah ^b   Sung, Wing Kin ^b   Ting, Hing Fung ^b  

^a Yale University   (United States)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

All cavity maximum weight matchings; Computational biology; Evolutionary trees; Label compressions; Mixed trees; Unrooted trees

Indexed keywords

COMPUTATIONAL METHODS; DATA COMPRESSION; EVOLUTIONARY ALGORITHMS; GRAPH THEORY; PROBLEM SOLVING; RECURSIVE FUNCTIONS;

CAVITY MATCHING; EVOLUTIONARY TREES;

TREES (MATHEMATICS);

EID: 0343337500     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797332275     Document Type: Article

References (26)

1. R. AGARWALA AND D. FERNÁNDEZ-BACA, A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed, SIAM J. Comput., 23 (1994), pp. 1216-1224.
2. A. V. AHO, J. E. HOPCROFT, AND J. D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
3. N. ALON AND B. SCHIEBER, Optimal Preprocessing for Answering On-Line Product Queries, Tech. Rep. 71, The Moise and Frida Eskenasy Institute of Computer Science, Tel Aviv University, Tel Aviv, Israel, 1987.
4. A. AMIR AND D. KESELMAN, Maximum agreement subtree in a set of evolutionary trees: Metrics and efficient algorithms, SIAM J. Comput., 26 (1997), pp. 1656-1669.
5. J. L. BENTLEY, D. HAKEN, AND J. B. SAXE, A general method for solving divide-and-conquer recurrences, SIGACT News, 12 (1980), pp. 36-44.
6. H. L. BODLAENDER, M. R. FELLOWS, AND T. J. WARNOW, Two strikes against perfect phylogeny, in Proceedings of the 19th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Comput. Sci. 623, Springer-Verlag, New York, 1992, pp. 273-283.
7. R. COLE AND R. HARIHARAN, An O(n log n) algorithm for the maximum agreement subtree problem for binary trees, in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, Atlanta, GA, 1996, pp. 323-332.
8. T. H. CORMEN, C. L. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
9. M. FARACH, T. PRZYTYCKA, AND M. THORUP, Computing the agreement of trees with bounded degrees, in Proceedings of the 3rd Annual European Symposium on Algorithms, Lecture Notes in Comput. Sci. 979, P. Spirakis, ed., Springer-Verlag, New York, 1995, pp. 381-393.
10. M. FARACH AND M. THORUP, Fast comparison of evolutionary trees, Inform. and Computation, 123 (1995), pp. 29-37.
11. M. FARACH AND M. THORUP, Sparse dynamic programming for evolutionary-tree comparison, SIAM J. Comput., 26 (1997), pp. 210-230.
12. C. R. FINDEN AND A. D. GORDON, Obtaining common pruned trees, J. Classification, 2 (1985), pp. 255-276.
13. H. N. GABOW AND R. E. TARJAN, Faster scaling algorithms for network problems, SIAM J. Comput., 18 (1989), pp. 1013-1036.
14. A. V. GOLDBERG, Scaling algorithms for the shortest paths problem, SIAM J. Comput., 24 (1995), pp. 494-504.
15. D. GUSFIELD, Optimal mixed graph augmentation, SIAM J. Comput., 16 (1987), pp. 599-612.
16. D. GUSFIELD, Efficient algorithms for inferring evolutionary trees, Networks, 21 (1991), pp. 19-28.
17. S. K. KANNAN, E. L. LAWLER, AND T. J. WARNOW, Determining the evolutionary tree using experiments, J. Algorithms, 21 (1996), pp. 26-50.
18. M. Y. KAO, Data security equals graph connectivity, SIAM J. Discrete Math., 9 (1996), pp. 87-100.
19. M. Y. KAO, Multiple-size divide-and-conquer recurrences, in Proceedings of the International Conference on Algorithms, the 1996 International Computer Symposium, National Sun Yat-Sen University, Kaohsiung, Taiwan, Republic of China, 1996, pp. 159-161.
20. Reprinted in SIGACT News, 28 (1997), pp. 67-69.
21. M. Y. KAO, Tree contractions and evolutionary trees, SIAM J. Comput., 27 (1998), pp. 1592-1616.
22. M. Y. KAO, T. W. LAM, W. K. SUNG, AND H. F. TING, All-cavity maximum matchings, in Proceedings of the 8th Annual International Symposium on Algorithms and Computation, Lecture Notes in Comput. Sci. 1350, H. Imai and H. W. Leong, eds., Springer-Verlag, New York, 1997, pp. 364-373.
23. T. W. LAM, W. K. SUNG, AND H. F. TING, Computing the unrooted maximum agreement subtree in sub-quadratic time, Nordic J. Comput. 3 (1996), pp. 295-322.
24. T. M. PRZYTYCKA, Transforming rooted agreement into unrooted agreement, J. Comput. Bio., 5 (1998), pp. 333-348.
25. M. STEEL AND T. WARNOW, Kaikoura tree theorems: Computing the maximum agreement subtree, Informat. Process. Lett., 48 (1994), pp. 77-82.
26. L. WANG, T. JIANG, AND E. LAWLER, Approximation algorithms for tree alignment with a given phylogeny, Algorithmica, 16 (1996), pp. 302-315.