E. Bapteste, L. Van-iersel, A. Janke, S. Kelchner, S. Kelk et al., Networks: expanding evolutionary thinking, Trends in Genetics, vol.29, issue.8, pp.439-441, 2013.

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

H. L. Bodlaender, R. G. Downey, M. R. Fellows, and D. Hermelin, On problems without polynomial kernels, Journal of Computer and System Sciences, vol.75, issue.8, pp.423-434, 2009.

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 and C. Semple, Computing the hybridization number of two phylogenetic trees is fixed-parameter tractable, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.4, issue.3, pp.458-466, 2007.

Z. Chen and L. Wang, Algorithms for reticulate networks of multiple phylogenetic trees, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.9, issue.2, pp.372-384, 2012.

Z. Chen and L. Wang, An ultrafast tool for minimum reticulate networks, Journal of Computational Biology, vol.20, issue.1, pp.38-41, 2013.

R. G. Downey and M. R. Fellows, Parameterized complexity, 1999.

J. Hein, Reconstructing evolution of sequences subject to recombination using parsimony, Mathematical biosciences, vol.98, issue.2, pp.185-200, 1990.

D. H. Huson, R. Rupp, and C. Scornavacca, Phylogenetic networks: concepts, algorithms and applications, 2011.

L. Van-iersel, Algorithms, haplotypes and phylogenetic networks, 2009.

L. Van-iersel, S. Kelk, N. Leki?, and L. Stougie, Approximation algorithms for nonbinary agreement forests, SIAM Journal on Discrete Mathematics, vol.28, issue.1, pp.49-66, 2014.

L. Van-iersel, S. Kelk, N. Leki?, C. Whidden, and N. Zeh, Hybridization number on three trees, 2014.

L. Van-iersel and S. Linz, A quadratic kernel for computing the hybridization number of multiple trees, Information Processing Letters, vol.113, issue.9, pp.318-323, 2013.

J. Jansson, N. B. Nguyen, and W. Sung, Algorithms for combining rooted triplets into a galled phylogenetic network, SIAM Journal on Computing, vol.35, issue.5, pp.1098-1121, 2006.

S. Kelk, L. Van-iersel, N. Leki?, S. Linz, C. Scornavacca et al.,

, On the comparative approximability of hybridization number and directed feedback vertex set, vol.26, pp.1635-1656, 2012.

S. Kelk and C. Scornavacca, Towards the fixed parameter tractability of constructing minimal phylogenetic networks from arbitrary sets of nonbinary trees, 2012.

S. Kelk and C. Scornavacca, Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable, Algorithmica, vol.68, pp.886-915, 2014.
URL : https://hal.archives-ouvertes.fr/hal-02154980

S. Linz and C. Semple, Hybridization in non-binary trees, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.6, issue.1, pp.30-45, 2009.

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

C. Mcdiarmid, C. Semple, and D. Welsh, Counting phylogenetic networks, Annals of Combinatorics, vol.19, issue.1, pp.205-224, 2015.

D. Morrison, Introduction to phylogenetic networks, RJR Productions, 2011.

L. Nakhleh, D. Ringe, and T. Warnow, Perfect phylogenetic networks: a new methodology for reconstructing the evolutionary history of natural languages, Language, vol.81, issue.2, pp.382-420, 2005.

T. Piovesan and S. Kelk, A simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary) trees, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.10, issue.1, pp.18-25, 2013.

C. Semple and M. Steel, Phylogenetics, 2003.

Y. S. Song and J. Hein, Parsimonious reconstruction of sequence evolution and haplotyde blocks: finding the minimum number of recombination events, Algorithms in Bioinformatics, vol.2812, pp.287-302, 2003.

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.

Y. Wu, Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees, Bioinformatics, vol.26, pp.140-148, 2010.

Y. Wu, An algorithm for constructing parsimonious hybridization networks with multiple phylogenetic trees, Journal of Computational Biology, vol.20, issue.10, pp.792-804, 2013.