1. Amir, A., Keselman, D.: Maximum agreement subtree in a set of evolutionary trees: metrics and efficient algorithms. SIAM J. Comput. 26(6), 1656–1669 (1997)
2. Lecture Notes in Computer Science;V. Berry,2004
3. Bryant, D.: Building trees, hunting for trees, and comparing trees: theory and methods in phylogenetic analysis. PhD thesis, University of Canterbury, Christchurch, New Zealand (1997)
4. Cole, R., Farach-Colton, M., Hariharan, R., Przytycka, T., Thorup, M.: An O(nlog n) algorithm for the maximum agreement subtree problem for binary trees. SIAM J. Comput. 30(5), 1385–1404 (2000)
5. Farach, M., Thorup, M.: Fast comparison of evolutionary trees. In: Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’94), pp. 481–488 (1994)