E. Tannier, C. Zheng, and D. Sankoff, Multichromosomal Genome Median and Halving Problems, proceedings of WABI'08, pp.1-13, 2008.
DOI : 10.1007/978-3-540-87361-7_1
URL : https://hal.archives-ouvertes.fr/hal-00428121

A. Bergeron, J. Mixtacki, and J. Stoye, A Unifying View of Genome Rearrangements, proceedings of WABI'06, pp.163-173, 2006.
DOI : 10.1007/11851561_16

J. Mixtacki, Genome Halving under DCJ Revisited, Proceedings of COCOON'08, 2008.
DOI : 10.1007/978-3-540-69733-6_28

R. Warren and D. Sankoff, Genome halving with double cut and join, Proceedings of the 6th Asia-Pacific Bioinformatics Conference, pp.231-240, 2008.

J. Aury, O. Jaillon, L. Duret, B. Noel, C. Jubin et al., Global trends of whole-genome duplications revealed by the ciliate Paramecium tetraurelia, Nature, vol.20, issue.7116, pp.171-178, 2006.
DOI : 10.1038/nature05230
URL : https://hal.archives-ouvertes.fr/hal-00090904

S. Otto and J. Whitton, Polyploid Incidence and Evolution, Annual Review of Genetics, vol.34, issue.1, pp.401-437, 2000.
DOI : 10.1146/annurev.genet.34.1.401

G. Watterson, W. Ewens, T. Hall, and A. Morgan, The chromosome inversion problem, Journal of Theoretical Biology, vol.99, issue.1, pp.1-7, 1982.
DOI : 10.1016/0022-5193(82)90384-8

D. Sankoff and M. Blanchette, The median problem for breakpoints in comparative genomics, Proceedings of the Third International Computing and Combinatorics Conference COCOON'97, pp.251-263, 1997.
DOI : 10.1007/BFb0045092

P. Pevzner and G. Tesler, Transforming men into mice, Proceedings of the seventh annual international conference on Computational molecular biology , RECOMB '03, pp.247-256
DOI : 10.1145/640075.640108

A. Bergeron, J. Mixtacki, and J. Stoye, On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios, Proceedings of Recomb Workshop on Comparative Genomics, 2008.
DOI : 10.1007/978-3-540-87989-3_17

S. Yancopoulos, O. Attie, and R. Friedberg, Efficient sorting of genomic permutations by translocation, inversion and block interchange, Bioinformatics, vol.21, issue.16, pp.3340-3346, 2005.
DOI : 10.1093/bioinformatics/bti535

Y. Lin, C. Lu, H. Chang, and C. Tang, An Efficient Algorithm for Sorting by Block-Interchanges and Its Application to the Evolution of Vibrio Species, Journal of Computational Biology, vol.12, issue.1, pp.102-112, 2005.
DOI : 10.1089/cmb.2005.12.102

A. Bergeron, J. Mixtacki, and J. Stoye, HP Distance Via Double Cut and Join Distance, Combinatorial Pattern Matching, proceedings of CPM'08, 2008.
DOI : 10.1007/978-3-540-69068-9_8

Y. Lin, C. Lu, Y. Liu, and C. Tang, SPRING: a tool for the analysis of genome rearrangement using reversals and block-interchanges, Nucleic Acids Research, vol.34, issue.Web Server, pp.696-699, 2006.
DOI : 10.1093/nar/gkl169

M. Alekseyev and P. Pevzner, Colored de Bruijn Graphs and the Genome Halving Problem, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.4, issue.1, pp.98-107, 2008.
DOI : 10.1109/TCBB.2007.1002

S. Hannenhalli and P. Pevzner, Transforming men into mice (polynomial algorithm for genomic distance problem), Proceedings of IEEE 36th Annual Foundations of Computer Science
DOI : 10.1109/SFCS.1995.492588

C. Zheng, Q. Zhu, and D. Sankoff, Descendants of Whole Genome Duplication within Gene Order Phylogeny, Journal of Computational Biology, vol.15, issue.8, pp.947-964, 2008.
DOI : 10.1089/cmb.2008.0118

C. Zheng, Q. Zhu, and D. Sankoff, Genome halving with an outgroup, Evolutionary Bioinformatics, vol.2, pp.319-326, 2006.

I. Pe-'er and R. Shamir, The median problems for breakpoints are NP-complete, Electronic Colloquium on Computational Complexity, vol.5, 1998.

D. Bryant, The complexity of the breakpoint median problem, 1998.

E. Ohlebusch, M. Abouelhoda, and K. Hockel, A linear time algorithm for the inversion median problem in circular bacterial genomes, Journal of Discrete Algorithms, vol.5, issue.4, pp.637-646, 2007.
DOI : 10.1016/j.jda.2006.12.006

M. Bernt, D. Merkle, and M. Middendorf, Solving the Preserving Reversal Median Problem, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.5, issue.3, pp.332-347, 2008.
DOI : 10.1109/TCBB.2008.39

L. Lovasz and M. Plummer, Matching Theory, of Annals of Discrete Mathematics, 1986.

M. Garey and D. Johnson, Computers and intractability. A guide to the theory of NP-completness, 1979.

C. Zheng, Q. Zhu, Z. Adam, and D. Sankoff, Guided genome halving: hardness, heuristics and the history of the Hemiascomycetes, Bioinformatics, vol.24, issue.13, pp.96-104, 2008.
DOI : 10.1093/bioinformatics/btn146

P. Berman and M. Karpinski, On some tighter inapproximability results. Automata, Languages and Programming, Lecture Notes In Computer Science, vol.1644, p.705, 1999.

W. Xu and D. Sankoff, Decompositions of Multiple Breakpoint Graphs and Rapid Exact Solutions to the Median Problem, proceedings of WABI'08, 2008.
DOI : 10.1007/978-3-540-87361-7_3

Z. Adam and D. Sankoff, The ABCs of MGR with DCJ, Evol Bioinform Online, vol.4, pp.69-74, 2008.

R. Lenne, C. Solnon, T. Stützle, E. Tannier, and M. Birattari, Reactive Stochastic Local Search Algorithms for the Genomic Median Problem, Proceedings of EvoCOP'08, pp.266-276, 2008.
DOI : 10.1007/978-3-540-78604-7_23
URL : https://hal.archives-ouvertes.fr/hal-00428150

N. El-mabrouk and D. Sankoff, The Reconstruction of Doubled Genomes, SIAM Journal on Computing, vol.32, issue.3, pp.754-792, 2003.
DOI : 10.1137/S0097539700377177

G. Tesler, Efficient algorithms for multichromosomal genome rearrangements, Journal of Computer and System Sciences, vol.65, issue.3, pp.587-609, 2002.
DOI : 10.1016/S0022-0000(02)00011-9

M. Ozery-flato and R. Shamir, TWO NOTES ON GENOME REARRANGEMENT, Journal of Bioinformatics and Computational Biology, vol.01, issue.01, pp.71-94, 2003.
DOI : 10.1142/S0219720003000198

G. Jean and M. Nikolski, Genome rearrangements: a correct algorithm for optimal capping, Information Processing Letters, vol.104, issue.1, pp.14-20, 2007.
DOI : 10.1016/j.ipl.2007.04.011
URL : https://hal.archives-ouvertes.fr/inria-00274291

C. Zheng, P. Wall, J. Leebens-mack, C. De-pamphilis, V. Albert et al., THE EFFECT OF MASSIVE GENE LOSS FOLLOWING WHOLE GENOME DUPLICATION ON THE ALGORITHMIC RECONSTRUCTION OF THE ANCESTRAL POPULUS DIPLOID, Computational Systems Bioinformatics, 2008.
DOI : 10.1142/9781848162648_0023

G. Bourque and P. Pevzner, Genome-scale evolution: Reconstructing gene orders in the ancestral species, Genome Research, vol.12, pp.26-36, 2002.

X. Chen, J. Zheng, Z. Fu, P. Nan, Y. Zhong et al., Assignment of Orthologous Genes via Genome Rearrangement, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.2, issue.4, pp.302-315, 2005.
DOI : 10.1109/TCBB.2005.48

S. Hannenhalli and P. Pevzner, Transforming cabbage into turnip, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing , STOC '95, pp.1-27, 1999.
DOI : 10.1145/225058.225112