J. Cotton and R. Page, Rates and patterns of gene duplication and loss in the human genome, Proceedings, pp.277-283, 2005.
DOI : 10.1098/rspb.2004.2969

B. Ma, M. Li, and L. Zhang, From Gene Trees to Species Trees, SIAM Journal on Computing, vol.30, issue.3, pp.729-752, 2000.
DOI : 10.1137/S0097539798343362

M. T. Hallett and J. Lagergren, New algorithms for the duplication-loss model, Proceedings of the fourth annual international conference on Computational molecular biology , RECOMB '00, pp.138-146, 2000.
DOI : 10.1145/332306.332359

K. Chen, D. Durand, and M. Farach-colton, NOTUNG: A Program for Dating Gene Duplications and Optimizing Gene Family Trees, Journal of Computational Biology, vol.7, issue.3-4, pp.429-444, 2000.
DOI : 10.1089/106652700750050871

B. Vernot, M. Stolzer, A. Goldman, and D. Durand, Reconciliation with Non-Binary Species Trees, Journal of Computational Biology, vol.15, issue.8, pp.981-1006, 2008.
DOI : 10.1089/cmb.2008.0092

C. Chauve, J. P. Doyon, and N. El-mabrouk, Gene Family Evolution by Duplication, Speciation, and Loss, Journal of Computational Biology, vol.15, issue.8, pp.1043-1062, 2008.
DOI : 10.1089/cmb.2008.0054

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

M. Goodman, J. Czelusniak, G. Moore, A. E. , R. H. Matsuda et al., Fitting the Gene Lineage into its Species Lineage, a Parsimony Strategy Illustrated by Cladograms Constructed from Globin Sequences, Systematic Zoology, vol.28, issue.2, pp.132-163, 1979.
DOI : 10.2307/2412519

L. Arvestad, A. Berglund, J. Lagergren, and B. Sennblad, Bayesian gene/species tree reconciliation and orthology analysis using MCMC, Bioinformatics, vol.19, issue.Suppl 1, pp.7-15, 2003.
DOI : 10.1093/bioinformatics/btg1000

URL : http://bioinformatics.oxfordjournals.org/cgi/content/short/19/suppl_1/i7

D. Durand, B. Halldrsson, and B. Vernot, A hybrid micro-macroevolutionary approach to gene tree reconstruction, J. Comput. Biol, pp.13-320, 2006.

B. R. Baum and M. A. Ragan, The MRP method Phylogenetic supertrees: combining information to reveal the Tree of Life, Kluwer, pp.17-34, 2004.

R. D. Page, Modified Mincut Supertrees, Proceedings of the 2nd International Workshop on Algorithms in Bioinformatics (WABI'02, pp.537-552, 2002.
DOI : 10.1007/3-540-45784-4_41

C. Scornavacca, V. Berry, V. Lefort, E. J. Douzery, and V. Ranwez, PhySIC_IST: cleaning source trees to infer more informative supertrees, BMC Bioinformatics, vol.9, issue.1, p.413, 2008.
DOI : 10.1186/1471-2105-9-413

URL : https://hal.archives-ouvertes.fr/lirmm-00324069

D. Gusfield, Efficient algorithms for inferring evolutionary trees, Networks, vol.14, issue.1, pp.12-28, 1991.
DOI : 10.1002/net.3230210104

A. V. Aho, Y. Sagiv, T. G. Szymanski, and J. D. Ullman, Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions, SIAM Journal on Computing, vol.10, issue.3, pp.405-421, 1981.
DOI : 10.1137/0210030

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

M. A. Bender and M. Farach-colton, The LCA Problem Revisited, Proceedings of the 4th Latin American Symposium on Theoretical Informatics, pp.88-94, 2000.
DOI : 10.1007/10719839_9

V. Berry and C. Semple, Fast Computation of Supertrees for Compatible Phylogenies with Nested Taxa, Systematic Biology, vol.55, issue.2, pp.270-288, 2006.
DOI : 10.1080/10635150500541649

URL : https://hal.archives-ouvertes.fr/lirmm-00131854

M. Steel, The complexity of reconstructing trees from qualitative characters and subtrees, Journal of Classification, vol.2, issue.2, pp.91-116, 1992.
DOI : 10.1007/BF02618470

S. Grunewald, M. A. Steel, and M. S. Swenson, Closure operations in phylogenetics, Mathematical Biosciences, vol.208, issue.2, pp.521-558, 2007.
DOI : 10.1016/j.mbs.2006.11.005

D. Bryant and M. Steel, Extension Operations on Sets of Leaf-Labeled Trees, Advances in Applied Mathematics, vol.16, issue.4, pp.425-453, 1995.
DOI : 10.1006/aama.1995.1020

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

A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, 1974.

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.56-798, 2007.
DOI : 10.1080/10635150701639754

URL : https://hal.archives-ouvertes.fr/lirmm-00194235

C. Semple and M. Steel, A supertree method for rooted trees, Discrete Applied Mathematics, vol.105, issue.1-3, pp.147-158, 2000.
DOI : 10.1016/S0166-218X(00)00202-X

J. Thorley, M. Wilkinson, and M. Charleston, The Information Content of Consensus Trees, Advances in Data Science and Classification . Studies in Classification, Data Analysis, and Knowledge Organization, pp.91-98, 1998.
DOI : 10.1007/978-3-642-72253-0_12