Поддерево максимального соответствия: различия между версиями

== Литература ==

1. Amir, A., Keselman, D.: Maximum agreement subtree in a set of evolutionary trees. SIAMJ.Comput. 26(6), 1656-1669(1997)

2. Cole, R., Hariharan, R.: An O(nlogn) algorithm for the maximum agreement subtree problem for binary trees. Proc. of the 7th ACM-SIAM SODA, pp. 323-332 (1996)

3. Cole, R., Farach-Colton, M., Hariharan, R., Przytycka, T., Thorup, M.: An O(n log n) algorithm for the maximum agreementsubtree problem for binary trees. SI AM J. Comput. 30(5), 1385-1404(2000)

4. Farach, M., Przytycka, T., Thorup, M.: The maximum agreement subtree problem for binary trees. Proc. of 2nd ESA (1995)

5. Farach, M., Przytycka, T., Thorup, M.: Agreement of many bounded degree evolutionary trees. Inf. Process. Lett. 55(6), 297-301 (1995)

6. Farach, M., Thorup, M.: Fast comparison of evolutionary trees. Inf. Comput. 123(1),29-37(1995)

7. Farach, M., Thorup, M.: Sparse dynamic programming for evolutionary-tree comparison. SI AM J. Comput. 26(1), 210-230 (1997)

8. Finden, C.R., Gordon, A.D.: Obtaining common pruned trees. J. Classific. 2,255-276 (1985)

9. Fredman, M.L.: Two applications of a probabilistic search technique: sorting X + Y and building balanced search trees. Proc. of the 7th ACM STOC, pp. 240-244 (1975)

10. Grishman, R., Yangarber, R.: Private Communication. NYU (1995)

11. Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13(2), 338-355 (1984)

12. Kao, M.-Y.: Tree contractions and evolutionary trees. SIAM J. Comput. 27(6), 1592-1616(1998)

13. Kubicka, E., Kubicki, G., McMorris, F.R.: An algorithm to find agreement subtrees. J. Classific. 12,91-100(1995)

14. Mehlhorn, K.: A best possible bound for the weighted path length of binary search trees. SIAM J. Comput. 6(2), 235-239 (1977)

15. Steel, M., Warnow, T.: Kaikoura tree theorems: computing the maximum agreement subtree. Inf. Process. Lett. 48, 77-82 (1993)