B. L. Allen and M. Steel, Subtree transfer operations and their induced metrics on evolutionary trees, Annals of combinatorics, vol.5, issue.1, pp.1-15, 2001.

M. Baroni, S. Grünewald, V. Moulton, and C. Semple, Bounding the number of hybridisation events for a consistent evolutionary history, Journal of mathematical biology, vol.51, issue.2, pp.171-182, 2005.

M. Baroni, C. Semple, and M. Steel, Hybrids in real time, Systematic Biology, vol.55, issue.1, pp.46-56, 2006.

M. Bordewich and C. Semple, On the computational complexity of the rooted subtree prune and regraft distance, Annals of combinatorics, vol.8, issue.4, pp.409-423, 2005.

M. Bordewich and C. Semple, Computing the hybridization number of two phylogenetic trees is fixed-parameter tractable, IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), vol.4, issue.3, pp.458-466, 2007.

M. Bordewich and C. Semple, Computing the minimum number of hybridization events for a consistent evolutionary history, Discrete Applied Mathematics, vol.155, issue.8, pp.914-928, 2007.

M. Bordewich, S. Linz, K. S. John, and C. Semple, A reduction algorithm for computing the hybridization number of two trees, Evolutionary bioinformatics online, vol.3, p.86, 2007.

J. Chen, J. H. Fan, and S. H. Sze, Parameterized and approximation algorithms for the MAF problem in multifurcating trees, Graph-Theoretic Concepts in Computer Science, pp.152-164, 2013.

Z. Z. Chen, Y. Fan, and L. Wang, Faster exact computation of rSPR distance, Journal of Combinatorial Optimization, vol.29, issue.3, pp.605-635, 2013.

M. T. Hallett and J. Lagergren, Efficient algorithms for lateral gene transfer problems, Proceedings of the fifth annual international conference on Computational biology, pp.149-156, 2001.

D. Harel and R. E. Tarjan, Fast algorithms for finding nearest common ancestors, siam Journal on Computing, vol.13, issue.2, pp.338-355, 1984.

J. Hein, T. Jiang, L. Wang, and K. Zhang, On the complexity of comparing evolutionary trees, Discrete Applied Mathematics, vol.71, issue.1, pp.153-169, 1996.

L. Van-iersel, S. Kelk, L. Stougie, and O. Boes, On unrooted and root-uncertain variants of several well-known phylogenetic network problems
URL : https://hal.archives-ouvertes.fr/hal-01599716

J. Jansson and W. K. Sung, Inferring a level-1 phylogenetic network from a dense set of rooted triplets, Theoretical Computer Science, vol.363, issue.1, pp.60-68, 2006.

S. Kelk, C. Scornavacca, and L. Van-iersel, On the elusiveness of clusters, IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), vol.9, issue.2, pp.517-534, 2012.

S. Linz and C. Semple, A cluster reduction for computing the subtree distance between phylogenies, Annals of Combinatorics, vol.15, issue.3, pp.465-484, 2011.

W. P. Maddison, Gene trees in species trees, Systematic biology, vol.46, issue.3, pp.523-536, 1997.

L. Nakhleh, T. Warnow, and C. R. Linder, Reconstructing reticulate evolution in species: theory and practice, Proceedings of the eighth annual international conference on Resaerch in computational molecular biology, pp.337-346, 2004.

C. Semple and M. A. Steel, Van Iersel L, Kelk S (2011) When two trees go to war, Journal of Theoretical Biology, vol.24, issue.1, pp.245-255, 2003.

L. Van-iersel, S. Kelk, and M. Mnich, Uniqueness, intractability and exact algorithms: reflections on level-k phylogenetic networks, Journal of Bioinformatics and Computational Biology, vol.7, issue.04, pp.597-623, 2009.

C. Whidden, R. G. Beiko, and N. Zeh, Fixed-parameter algorithms for maximum agreement forests, SIAM Journal on Computing, vol.42, issue.4, pp.1431-1466, 2013.

C. Whidden, R. Beiko, and N. Zeh, Computing the SPR distance of binary rooted trees in O(2 k n) time