1. Amir A, Keselman D (1997) Maximum agreement subtree in a set of evolutionary trees: metrics and efficient algorithms. SIAM J Comput 26(6):1656–1669
2. Berry V, Nicolas F (2006) Improved parameterized complexity of the maximum agreement subtree and maximum compatible tree problems. IEEE/ACM Trans Comput Biol Bioinform 3(3):289–302
3. Berry V, Guillemot S, Nicolas F, Paul C (2005) On the approximation of computing evolutionary trees. In: COCOON, Kunming, pp 115–125
4. Bryand D (1997) Building trees, hunting for trees, and comparing trees: theory and methods in phylogenetic analysis. Ph.D. thesis, Department of Mathematics, University of Canterbury
5. Cole R, Farach-Colton M, Hariharan R, Przytycka T, Thorup M (2001) An
o
(
n
log
n
)
$$o(n\log n)$$
algorithm for the maximum agreement subtree problem for binary trees. SIAM J Comput 1385–1404