N. Alon, B. Chor, F. Pardi, and A. Rapoport, Approximate maximum parsimony and ancestral maximum likelihood, IEEE/ACM Trans. Comput. Biol. Bioinformatics, vol.7, pp.183-187, 2010.

M. L. Arnold, Natural Hybridization and Evolution, 1996.

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

J. P. Bogart, Genetics and Systematics of Hybrid Species, pp.109-134, 2003.

E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis, The complexity of multiterminal cuts, SIAM J. Comput, vol.23, pp.864-894, 1994.

A. W. Edwards and L. L. Cavalli-sforza, Reconstruction of evolutionary trees, Systematics Association Publication, pp.64-76, 1964.

J. Felsenstein, Cases in which parsimony or compatibility will be positively misleading, Syst. Zool, vol.27, pp.401-410, 1978.

W. Fitch, Toward defining the course of evolution: Minimum change for a specific tree topology, Syst. Zool, vol.20, pp.406-416, 1971.

J. Flum and M. Grohe, Parameterized Complexity Theory, 2006.

L. R. Foulds and R. L. Graham, The Steiner problem in phylogeny is NP-complete, Adv. in Appl. Math, vol.3, pp.43-49, 1982.

D. H. Huson, R. Rupp, and C. Scornavacca, Phylogenetic Networks: Concepts, Algorithms and Applications, 2011.

D. H. Huson and C. Scornavacca, Dendroscope 3: A program for computing and drawing rooted phylogenetic trees and networks, Syst. Biol, pp.1061-1067, 2012.

L. J. Van-iersel, M. Fischer, S. M. Kelk, and C. Scornavacca, MPNet: Maximum Parsimony on Networks, 2013.

L. J. Van-iersel and S. M. Kelk, When two trees go to war, J. Theoret. Biol, vol.269, pp.245-255, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00653683

L. J. Van-iersel, C. Semple, and M. Steel, Locating a tree in a phylogenetic network, Inform. Process. Lett, vol.110, pp.1037-1043, 2010.

G. Jin, L. Nakhleh, S. Snir, and T. Tuller, Inferring phylogenetic networks by the maximum parsimony criterion: A case study, Mol. Biol. Evol, vol.24, pp.324-337, 2007.

G. Jin, L. Nakhleh, S. Snir, and T. Tuller, Parsimony score of phylogenetic networks: Hardness results and a linear-time heuristic, IEEE/ACM Trans. Comput. Biol. Bioinformatics, vol.6, pp.495-505, 2009.

I. A. Kanj, L. Nakleh, C. Than, and G. Xia, Seeing the trees and their branches in the network is hard, Theoret. Comput. Sci, vol.401, pp.153-164, 2008.

L. Kannan and W. C. Wheeler, Maximum parsimony on phylogenetic networks, Algorithms Mol. Biol, vol.7, p.9, 2012.

D. R. Karger, P. Klein, C. Stein, M. Thorup, and N. E. Young, Rounding algorithms for a geometric embedding of minimum multiway cut, Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing (STOC '99), pp.668-678, 1999.

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. M. Kelk, C. Scornavacca, and L. J. Van-iersel, On the elusiveness of clusters, IEEE/ACM Trans. Comput. Biol. Bioinformatics, vol.9, pp.517-534, 2012.

E. V. Koonin, K. S. Makarova, and L. Aravind, Horizontal gene transfer in prokaryotes: Quantification and classification, Annu. Rev. Microbiol, vol.55, pp.709-742, 2001.

, The Tree of Life Web Project, 2007.

L. Mcdaniel, E. Young, J. Delaney, F. Ruhnau, K. Ritchie et al., High frequency of horizontal gene transfer in the oceans, Science, vol.330, p.50, 2010.

D. A. Morrison, Introduction to Phylogenetic Networks, RJR Productions, 2011.

L. Nakhleh, Evolutionary phylogenetic networks: Models and issues, in The Problem Solving Handbook for, Computational Biology and Bioinformatics, pp.125-158, 2009.

C. T. Nguyen, N. B. Nguyen, W. K. Sung, and L. Zhang, Reconstructing recombination network from sequence data: The small parsimony problem, IEEE/ACM Trans. Comput. Biol. Bioinformatics, vol.4, pp.394-402, 2007.

R. Niedermeier, Invitation to Fixed Parameter Algorithms, Oxford Lecture Ser. Math. Appl, vol.31, 2006.

D. Sankoff and P. Rousseau, Locating the vertices of a Steiner tree in an arbitrary metric space, Math. Programming, vol.9, pp.240-246, 1975.

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

M. Xiao, Simple and improved parameterized algorithms for multiterminal cuts, Theory Comput. Syst, vol.46, pp.723-736, 2010.