1. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions;Aho;SIAM Journal on Computing,1981
2. Maximum agreement subtree in a set of evolutionary trees: Metrics and efficient algorithms;Amir;SIAM Journal on Computing,1997
3. Inferring evolutionary trees with strong combinatorial evidence;Berry;Theoretical Computer Science,2000
4. P. Bonizzoni, G. Della Vedova, G. Mauri, Approximating the maximum isomorphic agreement subtree is hard, in: R. Giancarlo, D. Sankoff (Eds.), Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching, in: Lecture Notes in Computer Science, vol. 1848, Montréal, Canada, 2000, pp. 119–128
5. D. Bryant, Building Trees, Hunting for Trees, and Comparing Trees, Ph.D. Thesis, University of Canterbury, Christchurch, New Zealand, 1997