J. Aberer and A. Stamatakis, A simple and accurate method for rogue taxon identification, Proceedings of the 2011 IEEE International Conference on Bioinformatics and Biomedicine, pp.118-122, 2011.

E. N. Adams, Consensus techniques and the comparison of taxonomic trees, Systematic Zoology, vol.21, pp.390-397, 1972.

D. Amir and . Keselman, Maximum agreement subtree in a set of evolutionary trees: metrics and efficient algorithms, SIAM Journal on Computing, vol.26, pp.1656-1669, 1997.

S. A. Berger, D. Krompass, and A. Stamatakis, Performance, accuracy, and web server for evolutionary placement of short sequence reads under maximum likelihood, Systematic Biology, vol.60, issue.3, pp.291-302, 2011.

O. R. Bininda-emonds, The delayed rise of present-day mammals, Nature, vol.446, issue.7135, pp.507-511, 2007.

P. Bonizzoni, G. D. Vedova, R. Dondi, and G. Mauri, The comparison of phylogenetic networks: algorithms and complexity, Bioinformatics Algorithms: Techniques and Applications, pp.143-173, 2008.

D. Bryant, Building trees, hunting for trees, and comparing trees: theory and methods in phylogenetic analysis, pp.174-182, 1997.

D. Bryant, Computing the quartet distance between evolutionary trees, Proceedings of the eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, vol.9, 2000.

D. Bryant, A Classification of Consensus Methods for Phylogenetics, Theoretical Computer Science, vol.61, pp.163-184, 2002.

J. J. Cannone, S. Subramanian, M. N. Schnare, J. R. Collett, L. M. Souza et al., The comparative RNA web (CRW) site: an online database of comparative sequence and structure information for ribosomal, intron, and other RNAs, BMC Bioinformatics, vol.3, issue.1, 2002.

L. L. Cavallip-sforza and A. W. Edwards, Phylogenetic analysis: models and estimation procedures, American Journal of Human Genetics, vol.19, pp.233-257, 1967.

J. Chiaroni, P. A. Underhill, and L. L. Cavalli-sforza, Y chromosome diversity, human expansion, drift, and cultural evolution, Proceedings of the National Academy of Sciences, vol.106, pp.20174-20179, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00439948

R. Cole, M. Farach, R. Hariharan, T. Przytycka, and M. Thorup, An O(n log n) algorithm for the maximum agreement subtree problem for binary trees, SIAM Journal on Computing, vol.30, pp.1385-1404, 2000.

B. Dasgupta, X. He, T. Jiang, M. Li, J. Tromp et al., On computing the nearest neighbor interchange distance, Proceedings of the DIMACS Workshop on Discrete Problems with Medical Applications, pp.125-168, 1997.

W. H. Day, Optimal algorithm for comparing trees with labeled leaves, Journal of Classification, vol.2, pp.7-28, 1985.

T. Z. Desantis, P. Hugenholtz, N. Larsen, M. Rojas, E. L. Brodie et al., Greengenes, a chimera-checked 16S rRNA gene database and workbench compatible with ARB, Applied and environmental microbiology, vol.72, issue.7, pp.5069-5072, 2006.

R. V. Eck and M. O. Dayoff, Atlas of Protein Sequence and Structure, National Biomedical Research Foundation, 1966.

M. Farach, T. Przytycka, and M. Thorup, The maximum agreement subtree problem for binary trees, Proceedings of the 2nd European Symposium on Algorithms, pp.381-393, 1995.

M. Farach, T. Przytycka, and M. Thorup, On the agreement of many trees, Information Processing Letters, vol.55, pp.297-301, 1995.

M. Farach and M. Thorup, Fast comparison of evolutionary trees, Information and Computation, vol.123, pp.29-37, 1995.

M. Farach and M. Thorup, Sparse dynamic programming for evolutionary-tree comparison, SIAM Journal on Computing, vol.26, pp.210-230, 1997.

N. R. Faria, Zika virus in the Americas: early epidemiological and genetic findings, vol.352, pp.345-349, 2016.

J. Felsenstein, Evolutionary trees from DNA sequences: a maximum likelihood approach, Journal of Molecular Evolution, vol.17, pp.368-376, 1981.

J. Felsenstein, Inferring Phylogenies, 2004.

R. Finden and A. D. Gordon, Obtaining common pruned trees, Journal of Classification, vol.2, pp.255-276, 1985.

D. Graur, On the immortality of television sets: "function" in the human genome according to the evolution-free gospel of ENCODE, Genome Biology and Evolution, vol.5, issue.3, pp.578-590, 2013.

M. Kao, Tree contractions and evolutionary trees, SIAM Journal on Computing, vol.27, pp.1592-1616, 1998.

M. Kao, T. Lam, W. Sung, and H. Ting, An even faster and more unifying algorithm comparing trees via unbalanced bipartite matchings, Journal of Algorithms, vol.20, issue.2, pp.212-233, 2001.

G. Kubicka, F. R. Kubicki, and . Mcmorris, An algorithm to find agreement subtrees, Journal of Classification, vol.12, pp.91-100, 1995.

G. Kubicka, F. Kubicki, and . Mcmorris, On Agreement Subtrees of Two Binary Trees, Congressus numerantium, vol.88, pp.217-224, 1992.

J. M. Lang, A. E. Darling, and J. A. Eisen, Phylogeny of bacterial and archaeal genomes using conserved genes: supertrees and supermatrices, PloS One, vol.8, issue.4, p.62510, 2013.

C. Lee, L. Hung, M. Chang, C. Shen, and C. Tang, An improved algorithm for the maximum agreement subtree problem, Information Processing Letters, vol.94, pp.211-216, 2005.

Y. Lin, V. Rajan, and B. M. Moret, A metric for phylogenetic trees based on matching, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.9, issue.4, pp.1014-1022, 2012.

K. Liu, C. R. Linder, and T. Warnow, Multiple sequence alignment: a major challenge to large-scale phylogenetics, PLoS Currents, vol.2, p.1198, 2010.

K. Liu, C. R. Linder, and T. Warnow, RAxML and FastTree: comparing two methods for large-scale maximum likelihood phylogeny estimation, PloS One, vol.6, issue.11, p.27731, 2011.

R. Mcmorris, D. B. Meronk, and D. A. Neumann, A view of some consensus methods for trees, Numerical Taxonomy, pp.122-125, 1983.

R. Munoz, P. Yarza, W. Ludwig, J. Euzéby, R. Amann et al., Release LTPs104 of the All-Species Living Tree, Systematic and Applied Microbioly, vol.34, pp.169-170, 2011.

.. D. Ni, A. J. Pattengale, K. M. Aberer, A. Swenson, B. M. Stamatakis et al., Uncovering hidden phylogenetic consensus in large data sets, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.8, issue.4, pp.902-911, 2011.

D. F. Robinson and L. R. Foulds, Comparison of phylogenetic trees, Mathematical Biosciences, vol.53, issue.1-2, pp.131-147, 1981.

N. Saitou and M. Nei, The neighbor-joining method: a new method for reconstructing phylogenetic trees, Molecular Biology and Evolution, vol.4, pp.406-425, 1987.

R. R. Sokal and F. J. Rohlf, The comparison of dendrograms by objective methods, Taxon, vol.11, pp.33-40, 1962.

A. Stamatakis, RAxML Version 8: A tool for Phylogenetic Analysis and Post-Analysis of Large Phylogenies, Bioinformatics, vol.30, issue.9, pp.1312-1313, 2014.

M. Steel and D. Penny, Distribution of tree comparison metrics-some new results, Systematic Biology, vol.42, issue.2, pp.126-141, 1993.

M. Steel and T. Warnow, Kaikoura tree theorems: Computing the maximum agreement subtree, Information Processing Letters, vol.48, pp.77-82, 1993.

K. M. Swenson, E. Chen, N. D. Pattengale, and D. Sankoff, The kernel of maximum agreement subtrees, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.9, issue.4, pp.1023-1031, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-02410429

D. L. Swofford and . Paup*, Phylogenetic Analysis Using Parsimony (* and Other Methods), 2002.

B. Wang and C. Li, Fast algorithms for computing path-difference distances, IEEE/ACM Transactions on Computational Biology and Bioinformatics

M. S. Waterman and T. F. Smith, On the similarity of dendrograms, Journal of Theoretical Biology, vol.73, issue.4, pp.789-800, 1978.

M. Wilkinson, Common cladistic information and its consensus representation: reduced Adams and reduced cladistic consensus trees and profiles, Systematic Biology, vol.43, issue.3, pp.343-368, 1994.

X. Zhou, X. Shen, C. T. Hittinger, and A. Rokas, Evaluating fast maximum likelihood-based phylogenetic programs using empirical phylogenomic data sets, Molecular Biology and Evolution, vol.35, issue.2, pp.486-503, 2018.