H. J. Bandelt and A. W. Dress, A canonical decomposition theory for metrics on a finite set, Advances in Mathematics, vol.92, issue.1, pp.47-105, 1992.
DOI : 10.1016/0001-8708(92)90061-O

V. Berry and F. Nicolas, Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.3, issue.3, pp.289-302, 2006.
DOI : 10.1109/TCBB.2006.39

M. Bordewich, A reduction algorithm for computing the hybridization number of two trees, Evol. Bioinform, vol.3, pp.86-98, 2007.

D. Bryant and V. Moulton, NeighborNet: An Agglomerative Method for the Construction of Planar Phylogenetic Networks, Algorithms in Bioinformatics, WABI 2002, pp.375-391, 2002.
DOI : 10.1007/3-540-45784-4_28

P. Charbit, A note on computing set overlap classes, Information Processing Letters, vol.108, issue.4, pp.186-191, 2008.
DOI : 10.1016/j.ipl.2008.05.005
URL : https://hal.archives-ouvertes.fr/lirmm-00325371

J. E. Cohen, Mathematics Is Biology's Next Microscope, Only Better; Biology Is Mathematics' Next Physics, Only Better, PLoS Biology, vol.88, issue.12, p.439, 2004.
DOI : 10.1371/journal.pbio.0020439.t001
URL : http://doi.org/10.1371/journal.pbio.0020439

W. F. Doolittle and E. Bapteste, Pattern pluralism and the Tree of Life hypothesis, Proc. Natl Acad. Sci. USA, pp.2043-2049, 2007.
DOI : 10.1073/pnas.0610699104

D. Gusfield and V. Bansal, A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters, Proceedings of the Ninth International Conference on Research in Computational Molecular Biology (RECOMB), 2005.
DOI : 10.1007/11415770_17

D. Gusfield, Efficient reconstruction of phylogenetic networks with constrained recombination, Proceedings of the IEEE Computer Society Conference on Bioinformatics, p.363, 2003.

D. Gusfield, A Decomposition Theory for Phylogenetic Networks and Incompatible Characters, Journal of Computational Biology, vol.14, issue.10, pp.1247-1272, 2007.
DOI : 10.1089/cmb.2006.0137

M. Hallett and J. Lagergren, Efficient algorithms for lateral gene transfer problems, Proceedings of the fifth annual international conference on Computational biology , RECOMB '01, pp.149-156, 2001.
DOI : 10.1145/369133.369188

J. Hein, A heuristic method to reconstruct the history of sequences subject to recombination, Journal of Molecular Evolution, vol.36, issue.4, pp.396-405, 1993.
DOI : 10.1007/BF00182187

K. T. Huber, Reconstructing the Evolutionary History of Polyploids from Multilabeled Trees, Molecular Biology and Evolution, vol.23, issue.9, pp.1784-1791, 2007.
DOI : 10.1093/molbev/msl045

D. H. Huson and T. H. Kloepper, Computing recombination networks from binary sequences, Bioinformatics, vol.21, issue.Suppl 2, pp.159-165, 2005.
DOI : 10.1093/bioinformatics/bti1126
URL : http://bioinformatics.oxfordjournals.org/cgi/content/short/21/suppl_2/ii159

D. H. Huson and D. Bryant, Application of Phylogenetic Networks in Evolutionary Studies, Molecular Biology and Evolution, vol.23, issue.2, pp.254-267, 2006.
DOI : 10.1093/molbev/msj030

D. Huson and T. H. Kloepper, Beyond Galled Trees - Decomposition and Computation of Galled Networks, Proceedings of the Eleventh International Conference on Research in Computational Molecular Biology (RECOMB), 2007.
DOI : 10.1007/978-3-540-71681-5_15

D. H. Huson and R. Rupp, Summarizing Multiple Gene Trees Using Cluster Networks, Algorithms in Bioinformatics, WABI 2008, pp.211-225, 2008.
DOI : 10.1007/978-3-540-87361-7_25

D. H. Huson, Phylogenetic super-networks from partial trees, IEEE/ACM TCBB, vol.1, pp.151-158, 2004.

D. H. Huson, Reconstruction of Reticulate Networks from Gene Trees, Proceedings of the Ninth International Conference on Research in Computational Molecular Biology (RECOMB), pp.233-249, 2005.
DOI : 10.1007/11415770_18

D. H. Huson, Dendroscope: An interactive viewer for large phylogenetic trees, BMC Bioinformatics, vol.8, issue.1, p.460, 2007.
DOI : 10.1186/1471-2105-8-460

I. A. Kanj, SEEING THE TREES AND THEIR BRANCHES IN THE NETWORK IS HARD, Theoretical Computer Science, pp.153-164, 2008.
DOI : 10.1142/9789812770998_0011

C. R. Linder and L. H. Rieseberg, Reconstructing patterns of reticulate evolution in plants, American Journal of Botany, vol.91, issue.10, pp.1700-1708, 2004.
DOI : 10.3732/ajb.91.10.1700

R. B. Lyngsø, Minimum Recombination Histories by Branch and Bound, Proceedings of the Workshop on Algorithms in Bioinformatics (WABI). Mallorca, Spain, pp.239-250, 2005.
DOI : 10.1007/11557067_20

B. Ma, Fixed topology alignment with recombination, Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching (CPM'98 of Lecture Notes in Computer Science, pp.174-188, 1998.

B. G. Mirkin, Algorithms for computing parsimonious evolutionary scenarios for genome evolution, the last universal common ancestor and domiance of horizontal gene transfer in the evolution of prokaryotes, BMC Evol. Biol, vol.3, issue.2, 2003.

M. Steel and A. Hamel, Finding a maximum compatible tree is NP-hard for sequences and trees, Appl. Math. Lett, vol.9, pp.55-60, 1996.

Y. S. Song and J. Hein, Constructing Minimal Ancestral Recombination Graphs, Journal of Computational Biology, vol.12, issue.2, pp.147-169, 2005.
DOI : 10.1089/cmb.2005.12.147

C. Than, PhyloNet: a software package for analyzing and reconstructing reticulate evolutionary relationships, BMC Bioinformatics, vol.9, issue.1, pp.1-16, 2008.
DOI : 10.1186/1471-2105-9-322

L. Van-iersel and S. Kelk, Constructing the simplest possible phylogenetic network from triplets, Proceedings of ISAAC'08, pp.472-483, 2008.

L. Van-iersel, Constructing Level-2 Phylogenetic Networks from Triplets, International Conference on Computational Molecular Biology (RECOMB), pp.450-462, 2008.
DOI : 10.1007/978-3-540-78839-3_40

L. Wang, Perfect phylogenetic networks with recombination, Proceedings of the 2001 ACM symposium on Applied computing , SAC '01, 2001.
DOI : 10.1145/372202.372271