Computing the quartet distance between evolutionary trees in time O(n log n), Algorithmica, vol.38, issue.2, pp.377-395, 2004. ,
Fast phylogenetic tree reconstruction using localitysensitive hashing, Algorithms in Bioinformatics, pp.14-29, 2012. ,
Fast error-tolerant quartet phylogeny algorithms, Theoretical Computer Science, vol.483, pp.104-114, 2013. ,
Computing the quartet distance between evolutionary trees, Proceedings of SODA 2000, pp.285-286, 2000. ,
Introduction to algorithms, vol.2, 2001. ,
Distribution and asymptotic behavior of the phylogenetic transfer distance, Journal of Mathematical Biology, 2019. ,
Optimal algorithms for comparing trees with labeled leaves, Journal of classification, vol.2, issue.1, pp.7-28, 1985. ,
A few logs suffice to build (almost) all trees: part II, Theoretical Computer Science, vol.221, issue.1-2, pp.77-118, 1999. ,
, Confidence limits on phylogenies: an approach using the bootstrap, vol.39, pp.783-791, 1985.
Clustering genes of common evolutionary history, Molecular biology and evolution, vol.33, issue.6, pp.1590-1605, 2016. ,
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
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. ,
RTED: a robust algorithm for the tree edit distance, Proceedings of the VLDB Endowment, vol.5, pp.334-345, 2011. ,
FastTree 2-approximately maximumlikelihood trees for large alignments, PloS one, vol.5, issue.3, p.9490, 2010. ,
A data structure for dynamic trees, Journal of Computer and System Sciences, vol.26, issue.3, pp.362-391, 1983. ,
Phylogeny: discrete and random processes in evolution, 2016. ,
DendroPy: a Python library for phylogenetic computing, Bioinformatics, vol.26, issue.12, pp.1569-1571, 2010. ,