K. Amenta and F. Clarke, A Linear-Time Majority Tree Algorithm, Proceedings of the 3rd International Workshop on Algorithms in Bioinformatics, pp.216-227, 2003.
DOI : 10.1007/978-3-540-39763-2_17

T. Y. Berger-wolf, Online Consensus and Agreement of Phylogenetic Trees, Proceedings of the 4th International Workshop on Algorithms in Bioinformatics, pp.350-361, 2004.
DOI : 10.1007/978-3-540-30219-3_30

R. Cole, M. Farach, R. Hariharan, T. Przytycka, and M. Thorup, ) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees, SIAM Journal on Computing, vol.30, issue.5, pp.1385-1404, 2000.
DOI : 10.1137/S0097539796313477

S. Dong and E. Kraemer, Calculation, visualization and manipulation of MASTs (maximum agreement subtrees), Proceedings of the IEEE Computational Systems Bioinformatics Conference, pp.1-10, 2004.

M. Farach and M. Thorup, Optimal evolutionary tree comparison by sparse dynamic programming, Proceedings 35th Annual Symposium on Foundations of Computer Science, pp.770-779, 1994.
DOI : 10.1109/SFCS.1994.365716

M. Farach and M. Thorup, Fast Comparison of Evolutionary Trees, Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.481-488, 1995.
DOI : 10.1006/inco.1995.1155

D. Gusfield, Efficient algorithms for inferring evolutionary trees. Networks, pp.19-28, 1991.

M. Y. Kao, Tree Contractions and Evolutionary Trees, SIAM Journal on Computing, vol.27, issue.6, pp.1592-1616, 1998.
DOI : 10.1137/S0097539795283504

M. Y. Kao, T. W. Lam, W. K. Sung, and H. F. Ting, A decomposition theorem for maximum weight bipartite matchings with applications in evolution trees, Proceedings of the 7th Annual European Symposium on Algorithms, pp.438-449, 1999.

M. Y. Kao, T. W. Lam, W. K. Sung, and H. F. Ting, An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings, Journal of Algorithms, vol.40, issue.2, pp.212-233, 2001.
DOI : 10.1006/jagm.2001.1163

D. Keselman and A. Amir, Maximum agreement subtree in a set of evolutionary trees-metrics and efficient algorithms, Proceedings 35th Annual Symposium on Foundations of Computer Science, pp.758-769, 1994.
DOI : 10.1109/SFCS.1994.365717

E. Kubicka, G. Kubicki, and F. Mcmorris, An algorithm to find agreement subtrees, Journal of Classification, vol.27, issue.1, pp.91-99, 1995.
DOI : 10.1007/BF01202269

A. Messmark, J. Jansson, A. Lingas, and E. Lundell, Polynomial-time algorithms for the ordered maximum agreement subtree problem, Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching, pp.220-229, 2004.

Z. S. Peng and H. F. Ting, An O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees, Proceedings of the 15th Symposium on Algorithms and Computations, pp.754-765, 2004.

T. Przytycka, Sparse dynamic programming for maximum agreement subtree problem, In Mathematical Hierarchies and Biology DIMACS series in Discrete Mathematics and Theoretical Computer Science, pp.249-264, 1997.

M. Steel and T. Warnow, Kaikoura tree theorems: Computing the maximum agreement subtree, Information Processing Letters, vol.48, issue.2, pp.77-82, 1994.
DOI : 10.1016/0020-0190(93)90181-8

T. J. Warnow, Tree Compatibility and Inferring Evolutionary History, Journal of Algorithms, vol.16, issue.3, pp.388-407, 1994.
DOI : 10.1006/jagm.1994.1018