H. Bandelt and A. W. , 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

H. Bandelt and A. W. , Split decomposition: A new and useful approach to phylogenetic analysis of distance data, Molecular Phylogenetics and Evolution, vol.1, issue.3, pp.242-2521055, 1992.
DOI : 10.1016/1055-7903(92)90021-8

H. Bandelt and A. W. , An order theoretic framework for overlapping clustering, Discrete Mathematics, vol.136, issue.1-3, pp.21-370012, 1994.
DOI : 10.1016/0012-365X(94)00105-R

H. Bandelt, P. Forster, C. Bryan, M. B. Sykes, and . Richards, Mitochondrial portraits of human population using median networks, Genetics, vol.141, issue.1412, pp.743-753743, 1995.

S. Mukul, J. Bansal, R. Peter-gogarten, and . Shamir, Detecting highways of horizontal gene transfer, Proceedings of the Eighth RECOMB Comparative Genomics Satellite Workshop, pp.109-120, 2011.

M. Baroni, C. Semple, and M. Steel, A Framework for Representing Reticulate Evolution, Annals of Combinatorics, vol.8, issue.4, pp.398-401, 2004.
DOI : 10.1007/s00026-004-0228-0

M. Baroni and M. Steel, Accumulation Phylogenies, Annals of Combinatorics, vol.10, issue.1, pp.19-30, 2006.
DOI : 10.1007/s00026-006-0271-0
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.1960

J. Barthélemy, F. Brucker, and C. Osswald, Combinatorial optimization and hierarchical classifications, Quarterly Journal of the Belgian, French and Italian Operations Research Societies, vol.2, issue.3, pp.179-219, 2004.
DOI : 10.1007/s10288-004-0051-9

J. Barthélemy and A. Guénoche, Les arbres et les représentations des proximités, p.17, 1988.

A. Batbedat, Les dissimilarités Médas ou Arbas, pp.1-18, 1989.

E. Kenneth and . Batcher, Sorting networks and their applications, Proceedings of the AFIPS Spring Joint Computer Conference, pp.307-314, 1968.

J. Becq, C. Churlaud, and P. Deschavanne, A Benchmark of Parametric Methods for Horizontal Transfers Detection, PLoS ONE, vol.9, issue.4, p.9989, 2010.
DOI : 10.1371/journal.pone.0009989.s002

G. Robert, N. Beiko, and . Hamilton, Phylogenetic identification of lateral genetic transfer events, BMC Evolutionary Biology, vol.6, issue.15, 2006.

R. G. Beiko, T. J. Harlow, and M. A. Ragan, Highways of gene sharing in prokaryotes, Proceedings of the National Academy of Sciences, vol.102, issue.40, pp.14332-14337, 2005.
DOI : 10.1073/pnas.0504068102

V. Berry and D. Bryant, Faster reliable phylogenetic analysis, Proceedings of the third annual international conference on Computational molecular biology , RECOMB '99, pp.59-68, 1999.
DOI : 10.1145/299432.299457

V. Berry and O. Gascuel, Inferring evolutionary trees with strong combinatorial evidence, Theoretical Computer Science, vol.240, issue.2, pp.271-298, 2000.
DOI : 10.1016/S0304-3975(99)00235-2

V. Berry, T. Jiang, P. E. Kearny, M. Li, and T. Wareham, Quartet Cleaning: Improved Algorithms and Simulations, Proceedings of the seventh Annual European Symposium on Algorithms (ESA'99), volume 1643 de Lecture Notes in Computer Science, pp.313-324, 1999.
DOI : 10.1007/3-540-48481-7_28
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.8521

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

P. Bertrand and M. F. Janowitz, Pyramids and weak hierarchies in the ordinal model for clustering, Discrete Applied Mathematics, vol.122, issue.1-3, pp.55-81, 2002.
DOI : 10.1016/S0166-218X(01)00354-7

R. P. Olaf, R. M. Bininda-emonds, A. Beck, and . Purvis, Getting to the roots of matrix representation, Systematic Biology, vol.54, issue.4, pp.668-672, 2005.

A. Boc, H. Philippe, and V. Makarenkov, Inferring and Validating Horizontal Gene Transfer Events Using Bipartition Dissimilarity, Systematic Biology, vol.59, issue.2, pp.195-211, 2010.
DOI : 10.1093/sysbio/syp103
URL : http://sysbio.oxfordjournals.org/cgi/content/short/59/2/195

S. Böcker, Q. B. , A. Bui, and A. Truss, An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees, Proceedings of the Third International Workshop on Parameterized and Exact Computation, pp.43-54, 2008.
DOI : 10.1007/978-3-540-79723-4_6

M. Bordewich, S. Linz, and K. St, John et Charles Semple : A reduction algorithm for computing the hybridization number of two trees, Evolutionary Bioinformatics, vol.3, pp.86-98, 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.
DOI : 10.1109/tcbb.2007.1019

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-918, 2007.
DOI : 10.1016/j.dam.2006.08.008

U. Brandes and S. Cornelsen, Phylogenetic graph models beyond trees, Discrete Applied Mathematics, vol.157, issue.10, pp.2361-2369, 2009.
DOI : 10.1016/j.dam.2008.06.031
URL : http://doi.org/10.1016/j.dam.2008.06.031

F. Brucker, Modèles de classification en classes empiétantes

D. Bryant, Building Trees, Hunting for Trees, and Comparing Trees : theory and method in phylogenetic analysis, Thèse de doctorat, pp.105-111, 1997.

D. Bryant and V. Berry, A Structured Family of Clustering and Tree Construction Methods, Advances in Applied Mathematics, vol.27, issue.4, pp.705-732, 2001.
DOI : 10.1006/aama.2001.0758

P. Buendia and G. Narasimhan, Serial NetEvolve: a flexible utility for generating serially-sampled sequences along a tree or recombinant network, Bioinformatics, vol.22, issue.18, pp.2313-2314, 2006.
DOI : 10.1093/bioinformatics/btl387

P. Buneman, F. R. Hodson, D. G. Kendall, and P. Tautu, The recovery of trees from measures of dissimilarity, éditeurs : Mathematics in Archeological and Historical Sciences, pp.387-395, 1971.

J. Byrka, P. Gawrychowski, K. T. Huber, and S. Kelk, Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks, Journal of Discrete Algorithms, vol.8, issue.1, pp.65-75, 2010.
DOI : 10.1016/j.jda.2009.01.004

G. Cardona, M. Llabrés, F. Rosselló, and G. Valiente, The comparison of treesibling time consistent phylogenetic networks is graph-isomorphism complete, 2009.

G. Cardona, M. Llabrés, F. Rosselló, and G. Valiente, Metrics for Phylogenetic Networks II: Nodal and Triplets Metrics, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.6, issue.3
DOI : 10.1109/TCBB.2008.127

G. Cardona, M. Llabrés, F. Rosselló, and G. Valiente, On Nakhleh's Metric for Reduced Phylogenetic Networks, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.6, issue.4, pp.629-638, 2009.
DOI : 10.1109/TCBB.2009.33
URL : http://upcommons.upc.edu/bitstream/2117/7141/1/ttb2009040629.pdf

G. Cardona, M. Llabrés, and F. Rosselló, A metric for galled networks, Bioinformatics for Personalized Medicine, 2010.

G. Cardona, M. Llabrés, F. Rosselló, and G. Valiente, A distance metric for a class of tree-sibling phylogenetic networks, Bioinformatics, vol.24, issue.13, pp.1481-1488, 2008.
DOI : 10.1093/bioinformatics/btn231

G. Cardona, M. Llabrés, F. Rosselló, and G. Valiente, Metrics for Phylogenetic Networks I: Generalizations of the Robinson-Foulds Metric, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.6, issue.1, pp.46-61, 2009.
DOI : 10.1109/TCBB.2008.70

G. Cardona, F. Rosselló, and G. Valiente, Extended newick : It is time for a standard representation, BMC Bioinformatics, vol.9, issue.460, pp.1471-2105, 2008.

G. Cardona, F. Rosselló, and G. Valiente, Tripartitions do not always discriminate phylogenetic networks, Mathematical Biosciences, vol.211, issue.2, p.53, 2008.
DOI : 10.1016/j.mbs.2007.11.003
URL : http://arxiv.org/abs/0707.2376

I. Cassens, P. Mardulyn, C. Michel, and . Milinkovitch, Evaluating Intraspecific ???Network??? Construction Methods Using Simulated Sequence Data: Do Existing Algorithms Outperform the Global Maximum Parsimony Approach?, Systematic Biology, vol.54, issue.3, pp.363-372, 2005.
DOI : 10.1080/10635150590945377

J. Ho-leung-chan, T. Jansson, S. Lam, and . Yiu, RECONSTRUCTING AN ULTRAMETRIC GALLED PHYLOGENETIC NETWORK FROM A DISTANCE MATRIX, Journal of Bioinformatics and Computational Biology, vol.04, issue.04, pp.807-832, 2006.
DOI : 10.1142/S0219720006002211

M. Chang, C. Lin, and P. Rossmanith, New fixed-parameter algorithms for the minimum quartet inconsistency problem, Theory of Computing Systems, vol.2, issue.47, pp.342-367, 2010.

P. Charbit, M. Habib, V. Limouzy, M. Fabien-de-montgolfier, M. Raffinot et al., 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

D. Chen, O. Eulenstein, D. Fernández-baca, and M. Sanderson, Minimum-Flip Supertrees: Complexity and Algorithms, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.3, issue.2, pp.165-173, 2006.
DOI : 10.1109/TCBB.2006.26

B. Chor, From Quartets to Phylogenetic Trees, Proceedings of the 25 t h Conference on Current Trends in Theory and Practice of Informatics : Theory and Practice of Informatics (SOFSEM'98), volume 1521 de Lecture Notes in Computer Science, pp.36-53, 1998.
DOI : 10.1007/3-540-49477-4_3

C. Choy, J. Jansson, K. Sadakane, . Wing-kin, and . Sung, Computing the maximum agreement of phylogenetic networks, Theoretical Computer Science, vol.335, issue.1, pp.93-107, 2005.
DOI : 10.1016/j.tcs.2004.12.012

J. Collins, S. Linz, and C. Semple, Quantifying Hybridization in Realistic Time, Journal of Computational Biology, vol.18, issue.10, 2011.
DOI : 10.1089/cmb.2009.0166

H. Colonius and H. Schulze, Tree structures for proximity data, British Journal of Mathematical and Statistical Psychology, vol.34, issue.2, pp.167-180, 1981.
DOI : 10.1111/j.2044-8317.1981.tb00626.x

P. Darlu and P. Tassy, La Reconstruction phylogénétique, Concepts et Méthodes. Masson, 1993.

M. Degiorgio and H. James, Fast and Consistent Estimation of Species Trees Using Supermatrix Rooted Triples, Molecular Biology and Evolution, vol.27, issue.3, pp.552-569, 2010.
DOI : 10.1093/molbev/msp250

H. James, N. A. Degnan, and . Rosenberg, Discordance of species trees with their most likely gene trees, PLoS Genetics, vol.2, issue.5, p.68, 2006.

H. Dell and . Dieter-van-melkebeek, Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses, Proceedings of the 42 nd ACM symposium on Theory of computing (STOC'10), 2010.

E. Diday, Orders and overlapping clusters in pyramids éditeurs : Multidimensional Data Analysis, pp.201-234, 1986.

R. Downey and R. Michael, Fellows : Parameterized complexity. Monographs in Computer Science, 1999.
DOI : 10.1007/978-1-4612-0515-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.3797

J. Doyon, C. Scornavacca, K. Y. Gorbunov, G. J. Szöllösi, V. Ranwez et al., An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers, Proceedings of the Eighth RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG'10), volume 6398 de Lecture Notes in Computer Science, pp.93-108, 2011.
DOI : 10.1007/978-3-642-16181-0_9
URL : https://hal.archives-ouvertes.fr/lirmm-00818889

A. W. Dress, K. T. Huber, and V. Moulton, Some Uses of the Farris Transform in Mathematics and Phylogenetics???A Review, Annals of Combinatorics, vol.11, issue.1, pp.1-37, 2007.
DOI : 10.1007/s00026-007-0302-5

A. W. Dress and H. Daniel, Constructing splits graphs, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.1, issue.3, pp.109-115, 2004.
DOI : 10.1109/TCBB.2004.27

A. W. Dress, V. Moulton, M. Steel, and T. Wu, Species, clusters and the ???Tree of life???: A graph-theoretic perspective, Journal of Theoretical Biology, vol.265, issue.4, pp.535-542, 2010.
DOI : 10.1016/j.jtbi.2010.05.031

J. Dufayard, L. Duret, S. Penel, and M. Gouy, Tree pattern matching in phylogenetic trees: automatic search for orthologs or paralogs in homologous gene sequence databases, Bioinformatics, vol.21, issue.11, pp.2596-2603, 2005.
DOI : 10.1093/bioinformatics/bti325
URL : https://hal.archives-ouvertes.fr/hal-00427861

L. Excoffier and E. Peter, Smouse : Using allele frequencies and geographic subdivision to reconstruct gene trees within a species : Molecular variance parsimony, Genetics, vol.136, issue.1361, pp.343-359343, 1994.

J. Felsenstein, Inferring Phylogenies, p.64, 2004.

G. Fertin, A. Labarre, and I. Rusu, Eric Tannier et Stéphane Vialette : Combinatorics of Genome Rearrangements, Computational Molecular Biology, 2009.

M. Walter and . Fitch, Homology : a personal view on some of the problems, Trends in Genetics, vol.16, issue.500, pp.227-231, 2000.

M. Foucault, Les mots et les choses -Une archéologie des sciences humaines, Tel Gallimard, pp.137-176, 1966.

N. Galtier, A Model of Horizontal Gene Transfer and the Bacterial Phylogeny Problem, Systematic Biology, vol.56, issue.4, pp.633-642, 2007.
DOI : 10.1080/10635150701546231
URL : https://hal.archives-ouvertes.fr/halsde-00424419

P. Gambette, Who is who in phylogenetic networks : articles, authors and programs, pp.9-54, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01376483

P. Gambette, V. Berry, and C. Paul, An obstruction approach to reconstruct phylogenies and level-k networks from triplets, 2008.

P. Gambette, V. Berry, and C. Paul, The Structure of Level-k Phylogenetic Networks, Proceedings of the 20 th Annual Symposium on Combinatorial Pattern Matching, pp.289-300, 2009.
DOI : 10.1089/cmb.2005.12.796
URL : https://hal.archives-ouvertes.fr/lirmm-00371485

P. Gambette, V. Berry, and C. Paul, QUARTETS AND UNROOTED PHYLOGENETIC NETWORKS, Journal of Bioinformatics and Computational Biology, vol.10, issue.04, pp.10-12, 2010.
DOI : 10.1142/S0219720012500047
URL : https://hal.archives-ouvertes.fr/hal-00678046

P. Gambette and K. T. Huber, A note on encodings of phylogenetic networks of bounded level, pp.10-12, 2010.

P. Gambette and H. Daniel, Huson : Improved layout of phylogenetic networks, IEEE/ACM Transactions in Computational Biology and Bioinformatics, vol.5, issue.3, 2008.

P. Gambette and J. Véronis, Visualising a text with a tree cloud Studies in Classification, Data Analysis, and Knowledge Organization, International Federation of Classification Societies 2009 Conference (IFCS'09), pp.561-570, 2010.

P. Górecki, Reconciliation problems for duplication, loss and horizontal gene transfer, Proceedings of the eighth annual international conference on Computational molecular biology , RECOMB '04, pp.316-325, 2004.
DOI : 10.1145/974614.974656

J. Gramm and R. Niedermeier, A fixed-parameter algorithm for minimum quartet inconsistency, Journal of Computer and System Sciences, pp.723-741, 2003.
DOI : 10.1016/S0022-0000(03)00077-1

V. Grant, Plant Speciation, 1971.

C. Nicholas, A. Grassly, and . Rambaut, Treevolve, a program to simulate the evolution of DNA sequences under different population dynamic scenarios, 1999.

S. Grünewald, K. Forslund, A. W. Dress, and V. Moulton, QNet: An Agglomerative Method for the Construction of Phylogenetic Networks from Weighted Quartets, Molecular Biology and Evolution, vol.24, issue.2, pp.532-538, 2007.
DOI : 10.1093/molbev/msl180

S. Grünewald, K. T. Huber, V. Moulton, C. Semple, and A. Spillner, Characterizing weak compatibility in terms of weighted quartets, Advances in Applied Mathematics, vol.42, issue.3, pp.329-341, 2009.
DOI : 10.1016/j.aam.2008.07.002

S. Grünewald, K. T. Huber, and Q. Wu, Two Novel Closure Rules for Constructing Phylogenetic Super-Networks, Bulletin of Mathematical Biology, vol.102, issue.Suppl. 1, pp.1906-1924, 2008.
DOI : 10.1007/s11538-008-9331-4

A. Guénoche, Graphical representation of a boolean array, Computers and the Humanities, vol.42, issue.3, pp.277-281, 1986.
DOI : 10.1007/BF02400118

A. Guénoche, Construction du treillis de Galois d'une relation binaire, Mathématiques et Sciences Humaines, vol.109, pp.41-53, 1990.

S. Guillemot and V. Berry, Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.7, issue.2, pp.342-353, 2010.
DOI : 10.1109/TCBB.2008.93
URL : https://hal.archives-ouvertes.fr/lirmm-00130406

S. Guillemot and M. Mnich, Kernel and Fast Algorithm for Dense Triplet Inconsistency, Proceedings of the seventh Annual Conference on Theory and Applications of Models of Computation, pp.247-257, 2010.
DOI : 10.1007/978-3-642-13562-0_23
URL : http://hdl.handle.net/11858/00-001M-0000-0024-468A-3

D. Gusfield and V. Bansal, A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters, Proceedings of the ninth Annual International Conference on Research in Computational Molecular Biology, pp.217-232, 2005.
DOI : 10.1007/11415770_17

D. Gusfield, V. Bansal, V. Bafna, and S. Yun, 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

D. Gusfield, S. Eddhu, and C. Langley, The Fine Structure of Galls in Phylogenetic Networks, INFORMS Journal on Computing, vol.16, issue.4, pp.459-469, 2004.
DOI : 10.1287/ijoc.1040.0099

W. Guttmann and M. Maucher, Variations on an Ordering Theme with Constraints, Proceedings of the 4 th IFIP International Conference on Theoretical Computer Science, pp.77-90, 2006.
DOI : 10.1007/978-0-387-34735-6_10

S. Halary, J. W. Leigh, B. Cheaib, P. Lopez, and E. Bapteste, Network analyses structure genetic diversity in independent genetic worlds, Proceedings of the National Academy of Sciences, vol.107, issue.1, pp.127-132, 2010.
DOI : 10.1073/pnas.0908978107

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.141-148, 2001.
DOI : 10.1145/369133.369188

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.
DOI : 10.1137/0213024

W. Hennig, Phylogenetic Systematics, Annual Review of Entomology, vol.10, issue.1, pp.29-32, 1966.
DOI : 10.1146/annurev.en.10.010165.000525

M. R. Henzinger, V. King, and T. Warnow, Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology, Algorithmica, vol.24, issue.1, pp.1-13, 1999.
DOI : 10.1007/PL00009268

B. R. Holland, G. Conner, K. T. Huber, and V. Moulton, Imputing Supertrees and Supernetworks from Quartets, Systematic Biology, vol.56, issue.1, pp.57-67, 2007.
DOI : 10.1080/10635150601167013
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.99.3215

R. Barbara, V. Holland, and . Moulton, Consensus networks : A method for visualising incompatibilities in collections of trees, Proceedings of the third Workshop on Algorithms in Bioinformatics (WABI'03), volume 2812 de Lecture Notes in Computer Science, pp.165-176, 2003.

E. John, R. M. Hopcroft, and . Karp, An n 5/2 algorithm for maximum matchings in bipartite graphs, SIAM Journal on Computing, vol.2, issue.4, pp.225-231, 1973.

L. Carl and . Hubbs, Hybridization between fish species in nature, Systematic Zoology, vol.4, issue.1, pp.1-20, 1955.

K. T. Huber, B. Oxelman, M. Lott, and V. Moulton, 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

K. T. Huber, L. Van-iersel, S. Kelk, and R. Suchecki, A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.8, issue.3, pp.106-132, 2010.
DOI : 10.1109/TCBB.2010.17

R. R. Hudson, Gene genealogies and the coalescent process, Oxford Surveys in Evolutionary Biology, vol.7, pp.1-44, 1991.

J. Huerta-cepas, A. Bueno, J. Dopazo, and T. Gabaldón, PhylomeDB: a database for genome-wide collections of gene phylogenies, Nucleic Acids Research, vol.36, issue.Database, pp.491-496, 2008.
DOI : 10.1093/nar/gkm899

H. Daniel, D. Huson, and . Bryant, Application of phylogenetic networks in evolutionary studies, Molecular Biology and Evolution, vol.23, issue.2, pp.254-267, 2006.

H. Daniel, T. Huson, M. Dezulian, C. Franz, D. C. Rausch et al., Dendroscope -an interactive tree drawer, BMC Bioinformatics, vol.8, issue.460, pp.23-139, 2007.

H. Daniel, T. Huson, T. Dezulian, M. Klöpper, and . Steel, Phylogenetic super-networks from partial trees, IEEE/ACM Transactions in Computational Biology and Bioinformatics, vol.1, issue.4, pp.151-158, 2004.

H. Daniel, T. Huson, and . Klöpper, Computing recombination networks from binary sequences, Proceedings of the fifth European Conference on Computational Biology, pp.159-165, 2005.

H. Daniel, T. Huson, and . Klöpper, Beyond galled trees -decomposition and computation of galled networks, Proceedings of the eleventh Annual International Conference on Research in Computational Molecular Biology, pp.211-225, 2007.

H. Daniel, T. Huson, P. J. Klöpper, M. Lockhart, and . Steel, Reconstruction of reticulate networks from gene trees, Proceedings of the ninth Annual International Conference on Research in Computational Molecular Biology (RECOMB'05), volume 3500 de Lecture Notes in Computer Science, pp.233-249, 2005.

H. Daniel, R. Huson, and . Rupp, Summarizing multiple gene trees using gene networks, Proceedings of the eighth Workshop on Algorithms in Bioinformatics (WABI'08, pp.296-305, 2008.

H. Daniel, R. Huson, V. Rupp, P. Berry, C. Gambette et al., Computing galled networks from real data, Proceedings of the 17th Annual Conference on Intelligent Systems for Molecular Biology & 8th European Conference on Computational Biology, pp.85-93, 2009.

H. Daniel, R. Huson, C. Rupp, and . Scornavacca, Phylogenetic Networks : Concepts, Algorithms and Applications, phylogenetic-networks.org, pp.54-130, 2011.

N. D. Trinh, J. Huynh, N. B. Jansson, . Nguyen, . Wing-kin et al., Constructing a smallest refining galled phylogenetic network, Proceedings of the ninth Annual International Conference on Research in Computational Molecular Biology (RECOMB'05), pp.265-280, 2005.

J. Jansson, On the Complexity of Inferring Rooted Evolutionary Trees, Proceedings of the Brazilian Symposium on Graphs, Algorithms, and Combinatorics, 2001.
DOI : 10.1016/S1571-0653(04)00222-7

J. Jansson, H. Joseph, K. Ng, . Sadakane, . Wing-kin et al., Rooted Maximum Agreement Supertrees, Algorithmica, vol.43, issue.4, pp.293-307, 2005.
DOI : 10.1007/s00453-004-1147-5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.2579

J. Jansson, N. B. Nguyen, . Wing-kin, and . Sung, Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network, SIAM Journal on Computing, vol.35, issue.5, pp.1098-1121, 2006.
DOI : 10.1137/S0097539704446529

J. Jansson, . Wing-kin, and . 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.
DOI : 10.1016/j.tcs.2006.06.022

G. Jin and L. Nakhleh, Sagi Snir et Tamir Tuller : Maximum likelihood of phylogenetic networks

D. S. Johnson, The NP-completeness column : An ongoing guide, Journal of Algorithms, vol.887, issue.5, pp.438-4480196, 1987.

H. Björn, F. Junker, and . Schreiber, Analysis of Biological Networks, 2008.

V. Kaibel and A. Schwartz, On the complexity of polytope isomorphism problems, Graphs and Combinatorics, vol.19, issue.2, pp.215-230, 2003.

A. Iyad, L. Kanj, and . Nakhleh, Cuong Than et Ge Xia : Seeing the trees and their branches in the network is hard, Theoretical Computer Science, vol.401, pp.153-164, 2008.

K. Sampath, E. L. Kannan, T. J. Lawler, and . Warnow, Determining the evolutionary tree using experiments, Journal of Algorithms, vol.21, issue.1, pp.26-50, 1996.

K. Denes, Gráphok és mátrixok Mathematikai és Fizikai Lapok, pp.116-119, 1931.

F. C. John, Kingman : Origins of the coalescent : 1974-1982, Genetics, vol.156156, issue.4, pp.1461-1463, 1461.

C. Komusiewicz and J. Uhlmann, A Cubic-Vertex Kernel for Flip Consensus Tree, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'08) Schloss Dagstuhl -Leibniz-Zentrum für Informatik, 2008.
DOI : 10.1007/s00453-012-9663-1
URL : https://hal.archives-ouvertes.fr/hal-01171577

L. S. Kubatko, Identifying Hybridization Events in the Presence of Coalescence via Model Selection, Systematic Biology, vol.58, issue.5, pp.478-488, 2009.
DOI : 10.1093/sysbio/syp055

E. L. Lawler and D. E. Wood, Branch-and-Bound Methods: A Survey, Operations Research, vol.14, issue.4, pp.699-719, 1966.
DOI : 10.1287/opre.14.4.699

P. Legendre and V. Makarenkov, Improving the additive tree representation of a given dissimilarity matrix using reticulations In Data Analysis, Classification, and Related Methods, Proceedings of the seventh Conference on the International Federation of Classification Societies (IFCS'00), pp.35-40, 2000.

E. M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time, Journal of Computer and System Sciences, vol.2582, issue.1, pp.42-65, 1982.

B. Ma, L. Wang, and M. Li, Fixed topology alignment with recombination, Discrete Applied Mathematics, vol.104, issue.00, pp.281-300, 2000.

D. Macleod, R. L. Charlebois, W. F. Doolittle, and E. Bapteste, Deduction of probable events of lateral gene transfer through comparison of phylogenetic trees by recursive consolidation and rearrangement, BMC Evolutionary Biology, vol.5, issue.27, pp.23-62, 2005.

V. Makarenkov, D. Kevorkov, and P. Legendre, Phylogenetic Network Construction Approaches, Applied Mycology and Biotechnology, pp.61-97, 2006.
DOI : 10.1016/S1874-5334(06)80006-7

K. Makino and T. Uno, New Algorithms for Enumerating All Maximal Cliques, Proceedings of the Ninth Scandinavian Workshop on Algorithm Theory, pp.260-272, 2004.
DOI : 10.1007/978-3-540-27810-8_23

C. A. Meacham, Theoretical and Computational Considerations of the Compatibility of Qualitative Taxonomic Characters, G1 de NATO ASI Series, pp.304-314, 1983.
DOI : 10.1007/978-3-642-69024-2_34

L. Gary and . Miller, Graph isomorphism, general remarks, Journal of Computer and System Sciences, vol.1879, issue.2, pp.128-1420022, 1979.

M. E. Bernard, L. Moret, T. Nakhleh, C. Warnow, A. Linder et al., Phylogenetic networks : Modeling, reconstructibility, and accuracy, IEEE/ACM Transactions in Computational Biology and Bioinformatics, vol.1, issue.1, pp.13-23, 2004.

M. M. Morin, M. E. Bernard, and . Moret, NETGEN: generating phylogenetic networks with diploid hybrids, Bioinformatics, vol.22, issue.15, pp.1921-1923, 2006.
DOI : 10.1093/bioinformatics/btl191

A. David and . Morrison, Networks in phylogenetic analysis : new tools for population biology, International Journal for Parasitology, vol.35, pp.567-582, 2005.

A. David and . Morrison, Using data-display networks for exploratory data analysis in phylogenetic studies, Molecular Biology and Evolution, vol.27, issue.5, pp.1044-1057, 2010.

V. Moulton and K. T. Huber, Phylogenetic networks from multi-labeled trees, Journal of Mathematical Biology, vol.52, issue.5, pp.613-632, 2006.

L. Nakhleh, A Metric on the Space of Reduced Phylogenetic Networks, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.7, issue.2, 2010.
DOI : 10.1109/TCBB.2009.2

L. Nakhleh, D. Ruths, and L. Wang, RIATA-HGT: A Fast and Accurate Heuristic for Reconstructing Horizontal Gene Transfer, Proceedings of the 11 th Annual International Computing and Combinatorics Conference, pp.84-93, 2005.
DOI : 10.1007/11533719_11

L. Nakhleh, T. Warnow, C. Linder, and K. St, Reconstructing Reticulate Evolution in Species???Theory and Practice, Journal of Computational Biology, vol.12, issue.6, pp.796-811, 2005.
DOI : 10.1089/cmb.2005.12.796

J. Opatrny, Total Ordering Problem, SIAM Journal on Computing, vol.8, issue.1, pp.111-114, 1979.
DOI : 10.1137/0208008

J. Pearl and M. Tarsi, Structuring causal trees, Journal of Complexity, vol.2, issue.1, pp.60-770885, 1986.
DOI : 10.1016/0885-064X(86)90023-3
URL : http://doi.org/10.1016/0885-064x(86)90023-3

R. Peeters, The maximum edge biclique problem is NP-complete, Discrete Applied Mathematics, vol.131, issue.3, pp.651-654, 2003.
DOI : 10.1016/S0166-218X(03)00333-0

D. Posada and K. A. Crandall, Intraspecific gene genealogies : trees grafting into networks . TRENDS in Ecology and Evolution, pp.37-45, 2001.
DOI : 10.1016/s0169-5347(00)02026-7

A. Mark and . Ragan, Trees and networks before and after Darwin, Biology Direct, vol.4, issue.43, pp.4-7, 2009.

V. Ranwez, V. Berry, A. Criscuolo, P. Fabre, S. Guillemot et al., PhySIC: A Veto Supertree Method with Desirable Properties, Systematic Biology, vol.56, issue.5, pp.798-817, 2007.
DOI : 10.1080/10635150701639754
URL : https://hal.archives-ouvertes.fr/lirmm-00194235

F. Rosselló and G. Valiente, All that glisters is not galled, Mathematical Biosciences, vol.221, issue.1, pp.54-59, 2009.
DOI : 10.1016/j.mbs.2009.06.007

M. J. Sanderson, A. C. Driskell, R. H. Ree, O. Eulenstein, and S. Langley, Obtaining Maximal Concatenated Phylogenetic Data Sets from Large Sequence Databases, Molecular Biology and Evolution, vol.20, issue.7, pp.1036-1042, 2003.
DOI : 10.1093/molbev/msg115
URL : http://mbe.oxfordjournals.org/cgi/content/short/20/7/1036

A. Schrijver, Combinatorial Optimization -Polyhedra and Efficiency, 2003.

C. Scornavacca, V. Berry, and V. Ranwez, Building species trees from larger parts of phylogenomic databases Information and Computation, pp.590-605, 2011.

C. Semple and M. Steel, Unicyclic Networks: Compatibility and Enumeration, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.3, issue.1, pp.84-91, 2006.
DOI : 10.1109/TCBB.2006.14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.3410

C. João, J. Setubal, and . Meidanis, Introduction to Computational Molecular Biology, 1997.

J. A. Neil and . Sloane, The on-line encyclopedia of integer sequences, p.119, 2010.

S. Snir and T. Tuller, THE NET-HMM APPROACH: PHYLOGENETIC NETWORK INFERENCE BY COMBINING MAXIMUM LIKELIHOOD AND HIDDEN MARKOV MODELS, Journal of Bioinformatics and Computational Biology, vol.07, issue.04
DOI : 10.1142/S021972000900428X

L. Van, I. , and S. Kelk, When two trees go to war, Journal of Theoretical Biology, vol.269, issue.1, pp.245-255, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00653683

S. Leo-van-iersel, M. Kelk, and . Mnich, UNIQUENESS, INTRACTABILITY AND EXACT ALGORITHMS: REFLECTIONS ON LEVEL-K PHYLOGENETIC NETWORKS, Journal of Bioinformatics and Computational Biology, vol.07, issue.04, pp.597-623, 2009.
DOI : 10.1142/S0219720009004308

S. Leo-van-iersel, R. Kelk, D. H. Rupp, and . Huson, Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters, Proceedings of the 18 th International Conference on Intelligent Systems in Molecular Biology (ISMB'10)
DOI : 10.1093/bioinformatics/btq202

C. Leo-van-iersel, M. Semple, and . Steel, Locating a tree in a phylogenetic network, Information Processing Letters, vol.110, issue.23, pp.59-61, 2010.
DOI : 10.1016/j.ipl.2010.07.027

F. B. Viégas and M. Wattenberg, TIMELINESTag clouds and the case for vernacular visualization, interactions, vol.15, issue.4, pp.49-52, 2008.
DOI : 10.1145/1374489.1374501

R. Wetzel, Zur Visualisierung abstrakter Ähnlichkeitsbeziehungen, Thèse de doctorat, 1995.

J. Stephen and . Willson, Unique determination of some homoplasies at hybridization events, Bulletin of Mathematical Biology, vol.69, issue.5, pp.1709-1725, 2007.

J. Stephen and . Willson, Properties of normal phylogenetic networks, Bulletin of Mathematical Biology, vol.72, issue.2, pp.340-358, 2010.

J. Stephen and . Willson, Regular networks can be uniquely constructed from their trees, IEEE/ACM Transactions in Computational Biology and Bioinformatics

M. Steven, D. Woolley, . Posada, and A. Keith, Crandall : A comparison of phylogenetic network methods using computer simulation, PLoS ONE, vol.3, issue.4, pp.1913-1943, 2008.

Y. Bang and . Wu, Constructing the maximum consensus tree from rooted triples, Journal of Combinatorial Optimization, vol.29, pp.29-39, 2004.

G. Wu, J. You, and G. Lin, A polynomial time algorithm for the minimum quartet inconsistency problem with quartet errors, Information Processing Letters, vol.100, issue.4, pp.167-171, 2006.
DOI : 10.1016/j.ipl.2006.05.013

Y. Wu, Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees, Proceedings of the 18 th International Conference on Intelligent Systems in Molecular Biology (ISMB'10), pp.140-148, 2010.
DOI : 10.1093/bioinformatics/btq198

Y. Wu and J. Wang, Fast computation of the exact hybridization number of two phylogenetic trees Lecture Notes in Computer Science, Proceedings of the sixth International Symposium on Bioinformatics Research and Applications (ISBRA'10), 2010.

C. Yan, J. G. Burleigh, and O. Eulenstein, Identifying optimal incomplete phylogenetic data sets from sequence databases, Molecular Phylogenetics and Evolution, vol.35, issue.3, pp.528-535, 2005.
DOI : 10.1016/j.ympev.2005.02.008

N. Viktor, N. M. Zemlyachenko, . Korneenko, and I. Regina, Tyshkevich : Graph isomorphism problem, Journal of Mathematical Sciences, vol.29, issue.4, pp.1426-1481, 1985.

.. Réseau-réticulé, 54 réseau simple non enraciné de niveau 1 56 90 restriction (clades) restriction (quadruplets) restriction (triplets), pp.83-94, 1921.

S. Sans-descendance-hybride-séparation and .. , 175 sans fratrie hybride144 silence 105 simple (graphe), 38 simple (réseau), p.17539

.. Sommet-isolé, 15 source 17 sous-graphe induit, 15 spéciation . . . . . . . . . . . . . . . . . . . . . . . . . . 5, p.129

.. Strictement-de-niveau-k, 37 subdivision, p.51

B. De, Réseau simple de niveau 1 non enraciné construit à partir d'une solution, p.71