Computing the unrooted maximum agreement subtree in sub-quadratic time

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

Volumn 1097, Issue , 1996, Pages 124-135

  Lam, T W ^a   Sung, W K ^a   Ting, H F ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

EVOLUTIONARY TREE; MAXIMUM AGREEMENT SUBTREES; QUADRATIC TIME; QUADRATIC TIME ALGORITHMS; SUBTREES; TIME BOUND; TIME COMPLEXITY;

TREES (MATHEMATICS);

EID: 84947940707     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61422-2_126     Document Type: Conference Paper

References (15)

1. R. Agarwala and D. Fernandez-Baca, A polynomial-time algorithm for the phylogeny problem when the number of character states is fixed, FOCS, 140-147, 1993.
2. H. Bodlaender, M. Fellows and T. Warnow, Two strikes against perfect phylogeny, ICALP, 273-283, 1992.
3. R. Cole and R. Hariharan, An O(n log n) algorithm for the maximum agreement subtree problem for binary trees, SODA, 323-332, 1996.
4. W.H.E. Day, Computational complexity of inferring phylogenies from dissimilarity matrices, Bulletin of Mathematical Biology, 49(4):461-467, 1987.
5. M. Farach and M. Thorup, Fast comparison of evolutionary trees, SODA, 481-488, 1994.
6. M. Farach and M. Thorup, Optimal evolutionary tree comparison by sparse dynamic programming, FOCS, 770-779, 1994.
7. M. Farach, T. Przytycka and M. Thorup, Computing the agreement of trees with bounded degrees, ESA, 381-393, 1995.
8. J. Felsenstein, Numerical methods for inferring evolutionary tree, The Quarterly Review of Biology, 57(4):379-404, 1982.
9. C. Finden and A. Gordon, Obtaining common pruned trees, Journal of Classification, 2:255-276, 1985.
10. H. Gabow and R. Tarjan, Faster scaling algorithms for network problems, SIAM Journal of Computing, 18(5): 1013-1036, 1989.
11. S. Kannan, T. Warnow and S. Yooseph, Computing the local consensus of trees, SODA, 68-77, 1995.
12. J. Kececioglu and D. Gusfield, Reconstructing a history of recombinations from a set of sequences, SODA, 471-480, 1994.
13. D. Keselman and A. Amir, Maximum agreement subtree in a set of evolutionary trees-Metrics and efficient algorithms, FOCS, 758-769, 1994.
14. E. Kubicka, G. Kubicki and F. McMorris, An algorithm to find agreement subtrees, Journal of Classification, 1994.
15. M. Steel and T. Warnow, Kaikoura tree theorems: computing the maximum agreement subtree, Information Processing Letters, 48:77-82, 1994.