P. Alimonti and V. Kann, Some APX-completeness results for cubic graphs, Theoretical Computer Science, vol.237, issue.1-2, pp.123-134, 2000.
DOI : 10.1016/S0304-3975(98)00158-3

M. S. Bansal, J. G. Burleigh, O. Eulenstein, and A. Wehe, Heuristics for the Gene-Duplication Problem: A ??(n) Speed-Up for the Local Search, LNCS, vol.4453, pp.238-252, 2007.
DOI : 10.1007/978-3-540-71681-5_17

M. S. Bansal, O. Eulenstein, and A. Wehe, The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI-Based Local Searches, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.6, issue.2, pp.221-231, 2009.
DOI : 10.1109/TCBB.2009.7

M. S. Bansal and R. Shamir, A Note on the Fixed Parameter Tractability of the Gene-Duplication Problem, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.8, issue.3, pp.848-850, 2011.
DOI : 10.1109/TCBB.2010.74

J. Byrka, S. Guillemot, and J. Jansson, New results on optimizing rooted triplets consistency, Discrete Applied Mathematics, vol.158, issue.11, pp.1136-1147, 2010.
DOI : 10.1016/j.dam.2010.03.004

URL : https://hal.archives-ouvertes.fr/hal-00824940

W. Chang, J. G. Burleigh, D. F. Fernández-baca, and O. Eulenstein, An ILP solution for the gene duplication problem, BMC Bioinformatics, vol.12, issue.Suppl 1, p.14, 2011.
DOI : 10.1186/1471-2105-12-S1-S14

C. Chauve and N. El-mabrouk, New Perspectives on Gene Family Evolution: Losses in Reconciliation and a Link with Supertrees, LNCS, vol.5541, pp.46-58, 2009.
DOI : 10.1007/978-3-642-02008-7_4

E. E. Eichler and D. Sankoff, Structural Dynamics of Eukaryotic Chromosome Evolution, Science, vol.301, issue.5634, pp.521-565, 2003.
DOI : 10.1126/science.1086132

J. Felsenstein, Phylogenies from Molecular Sequences: Inference and Reliability, Annual Review of Genetics, vol.22, issue.1, pp.521-565, 1988.
DOI : 10.1146/annurev.ge.22.120188.002513

W. M. Fitch, Homology, Trends in Genetics, vol.16, issue.5, pp.227-231, 2000.
DOI : 10.1016/S0168-9525(00)02005-9

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

J. Kleinberg and E. Tardos, Algorithm Design. Pearson Education, 2006.

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

A. Ouangraoua, K. M. Swenson, and C. Chauve, An Approximation Algorithm for Computing a Parsimonious First Speciation in the Gene Duplication Model, LNCS, vol.6398, pp.290-301, 2010.
DOI : 10.1007/978-3-642-16181-0_24

URL : https://hal.archives-ouvertes.fr/hal-00527624

U. Stege, Gene Trees and Species Trees: The Gene-Duplication Problem is Fixed-Parameter Tractable, 6th International Workshop on Algorithms and Data Structures (WADS'99), volume 1663 of LNCS, pp.288-293, 1999.
DOI : 10.1007/3-540-48447-7_29

D. J. Welsh and M. B. Powell, An upper bound for the chromatic number of a graph and its application to timetabling problems, The Computer Journal, vol.10, issue.1, pp.85-86, 1967.
DOI : 10.1093/comjnl/10.1.85