Transforming rooted agreement into unrooted agreement

Journal of Computational Biology

Volumn 5, Issue 2, 1998, Pages 335-349

  Przytycka, Teresa M ^a  

^a JOHNS HOPKINS UNIVERSITY SCHOOL OF MEDICINE   (United States)

Author keywords

Maximum agreement subtree; Phylogenic tree; Tree comparison

Indexed keywords

ALGORITHM; ARTICLE; EVOLUTION; MATHEMATICAL ANALYSIS; PHYLOGENY; PRIORITY JOURNAL; STATISTICAL ANALYSIS;

EID: 0031878671     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.1998.5.335     Document Type: Article

References (14)

1. Cole, R., Farach, M., Hairhanan, R., Przytycka, T.M., Thorup, M. An O(n log n) time algorithm for the maximum agreement subtree problem for binary trees. SIAM J.Comp, submitted.
2. Cole, R., Hairhanan, R. 1996. An O(n log n) time algorithm for the maximum agreement subtree problem for binary trees. Proc. of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 323-332.
3. SODA 96 323-332.
4. Jacobson, G., and Vo, K.-P. 1992. Heaviest increasing/common subsequence problems. In Proceedings of the Combinatorial Matching Conferences.
5. Lam, T.W., Sung, W.K., Ting, H.F. 1996. Computing the unrooted maximum agreement subtree in sub-quadratic time. Proc. of SWAT'96 LNCS 1097, 124-135.
6. Farach, M., Przytycka, T.M., Thorup, M. 1995. Agreement of bounded degree trees. ESA95 381-394.
7. Farach, M., Przytycka, T.M., Thorup, M. 1995. On the agreement of many trees. IPL 55, 297-301.
8. Farach, M., and Thorup, M. 1994. Fast comparison of evolutionary trees (extended abstract). SODA94 481-488.
9. Farach, M., and Thorup, M. 1994. Sparse dynamic programming for evolutionary tree comparison. Proc. of the 35th IEEE Annual Symp. on Foundation of Computer Science, FOCS94 770-779.
10. Kao, M.-Y. 1995. Tree contractions and evolutionary trees. To appear in SIAM Journal of Computing.
11. Kao, M.-Y., Lam, T.W., Sung, W.K., Ting, H.F. Label compression and unrooted evolutionary trees. Submitted.
12. Kao, M.-Y., Lam, T.W., Przytycka, T.M., Sung, W.K., Ting, H.F. 1997. General techniques for comparing unrooted evolutionary tree. Proc. of the 29th Annual ACM Symp. on Theory of Computing, STOC97 54-55.
13. Przytycka, T.M. Sparse dynamic programming for maximum agreement subtree problem. Submitted.
14. Steel, M. and Warnow, T. 1993. Kaikoura tree theorems: Computing the maximum agreement subtree. Information Processing Letters, 48:77-82, 1993.