. Gs-brodal, C. Fagerberg, and . Pedersen, Computing the quartet distance between evolutionary trees in time O(n log n), Algorithmica, vol.38, issue.2, pp.377-395, 2004.

G. Daniel, J. Brown, and . Truszkowski, Fast phylogenetic tree reconstruction using localitysensitive hashing, Algorithms in Bioinformatics, pp.14-29, 2012.

G. Daniel, J. Brown, and . Truszkowski, Fast error-tolerant quartet phylogeny algorithms, Theoretical Computer Science, vol.483, pp.104-114, 2013.

D. Bryant, . Tsang, M. Kearney, and . Li, Computing the quartet distance between evolutionary trees, Proceedings of SODA 2000, pp.285-286, 2000.

C. E. Thomas-h-cormen, R. L. Leiserson, C. Rivest, and . Stein, Introduction to algorithms, vol.2, 2001.

J. M-dávila-felipe, F. Entfellner, . Lemoine, O. Truszkowski, and . Gascuel, Distribution and asymptotic behavior of the phylogenetic transfer distance, Journal of Mathematical Biology, 2019.

. Whe-day, Optimal algorithms for comparing trees with labeled leaves, Journal of classification, vol.2, issue.1, pp.7-28, 1985.

L. Péter, . Erdös, A. Michael, . Steel, A. László et al., A few logs suffice to build (almost) all trees: part II, Theoretical Computer Science, vol.221, issue.1-2, pp.77-118, 1999.

J. Felsenstein, Confidence limits on phylogenies: an approach using the bootstrap, vol.39, pp.783-791, 1985.

K. Gori, . Suchan, N. Alvarez, C. Goldman, and . Dessimoz, Clustering genes of common evolutionary history, Molecular biology and evolution, vol.33, issue.6, pp.1590-1605, 2016.

F. Lemoine, J. Entfellner, E. Wilkinson, D. Correia, . Dávila-felipe et al., Renewing Felsenstein's phylogenetic bootstrap in the era of big data, Nature, vol.556, issue.7702, p.452, 2018.
URL : https://hal.archives-ouvertes.fr/lirmm-02078445

Y. Lin, . Vaibhav-rajan, . Bernard, and . Moret, A metric for phylogenetic trees based on matching, IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), vol.9, issue.4, pp.1014-1022, 2012.

M. Pawlik and . Augsten, RTED: a robust algorithm for the tree edit distance, Proceedings of the VLDB Endowment, vol.5, pp.334-345, 2011.

. Morgan-n-price, S. Paramvir, A. P. Dehal, and . Arkin, FastTree 2-approximately maximumlikelihood trees for large alignments, PloS one, vol.5, issue.3, p.9490, 2010.

D. D. Sleator and . Tarjan, A data structure for dynamic trees, Journal of Computer and System Sciences, vol.26, issue.3, pp.362-391, 1983.

M. Steel, Phylogeny: discrete and random processes in evolution, 2016.

J. Sukumaran, T. Mark, and . Holder, DendroPy: a Python library for phylogenetic computing, Bioinformatics, vol.26, issue.12, pp.1569-1571, 2010.