1. Faster exact solutions for hard problems;Alber;Discrete Math.,2001
2. Reconstructing the shape of a tree from observed dissimilarity data;Bandelt;Adv. Appl. Math.,1986
3. Constructing phylogenies from quartets;Ben-Dor;J. Comput. Biol.,1998
4. V. Berry, D. Bryant, T. Jiang, P. Kearney, M. Li, T. Wareham, H. Zhang, A practical algorithm for recovering the best supported edges of an evolutionary tree, in: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), Society for Industrial and Applied Mathematics, Philadelphia, 2000, pp. 287–296.
5. Inferring evolutionary trees with strong combinatorial evidence;Berry;Theoret. Comput. Sci.,2000