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

M. Alekseyev and P. Pevzner, Multi-break rearrangements and chromosomal evolution, Theoretical Computer Science, vol.395, issue.2-3, 2008.
DOI : 10.1016/j.tcs.2008.01.013
URL : http://doi.org/10.1016/j.tcs.2008.01.013

S. Bérard, A. Bergeron, and C. Chauve, Conservation of Combinatorial Structures in Evolution Scenarios, LNCS/LNBI, vol.3388, pp.1-14, 2004.
DOI : 10.1007/978-3-540-32290-0_1

S. Bérard, A. Bergeron, C. Chauve, and C. Paul, Perfect Sorting by Reversals Is Not Always Difficult, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.4, issue.1, pp.4-16, 2007.
DOI : 10.1109/TCBB.2007.1011

S. Bérard, C. Chauve, and C. Paul, A more efficient algorithm for perfect sorting by reversals, Proc. Letters, pp.90-95, 2008.
DOI : 10.1016/j.ipl.2007.10.012

A. Bergeron, C. Chauve, F. De-montgolfier, and M. Raffinot, Permutations, with Applications to Modular Decomposition of Graphs, ESA 2005, pp.779-790, 2005.
DOI : 10.1137/060651331
URL : https://hal.archives-ouvertes.fr/hal-00159580

A. Bergeron, J. Mixtacki, and J. Stoye, Mathematics of Evolution and Phylogeny, chapter The inversion distance problem, 2005.

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

M. Bernt, D. Merkle, and M. Middendorf, A Fast and Exact Algorithm for the Perfect Reversal Median Problem, ISBRA 2007, pp.305-316, 2007.
DOI : 10.1007/978-3-540-72031-7_28

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

M. Braga, M. Sagot, C. Scornavacca, and E. Tannier, Exploring the Solution Space of Sorting by Reversals, with Experiments and an Application to Evolution, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.5, issue.3, 2008.
DOI : 10.1109/TCBB.2008.16
URL : https://hal.archives-ouvertes.fr/hal-00428206

A. Caprara, The Reversal Median Problem, INFORMS Journal on Computing, vol.15, issue.1, pp.93-113, 2003.
DOI : 10.1287/ijoc.15.1.93.15155
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.391

Y. Diekmann, M. Sagot, and E. Tannier, Evolution under Reversals: Parsimony and Conservation of Common Intervals, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.4, issue.2, pp.301-109, 2007.
DOI : 10.1109/TCBB.2007.1042
URL : https://hal.archives-ouvertes.fr/hal-00434588

M. Figeac and J. Varré, Sorting by Reversals with Common Intervals, WABI 2004, pp.26-37, 2004.
DOI : 10.1007/978-3-540-30219-3_3

M. Habib, C. Paul, and M. Raffinot, Common connected components of interval graphs, LNCS, vol.3109, pp.347-358, 2004.
DOI : 10.1007/978-3-540-27801-6_27
URL : https://hal.archives-ouvertes.fr/lirmm-00269548

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

S. Hannenhalli and P. A. Pevzner, Transforming men into mice (polynomial algorithm for genomic distance problem), Proceedings of IEEE 36th Annual Foundations of Computer Science, pp.581-592, 1995.
DOI : 10.1109/SFCS.1995.492588
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.7597

W. Hsu and R. M. Mcconnell, PC trees and circular-ones arrangements, Theoretical Computer Science, vol.296, issue.1, pp.99-116, 2003.
DOI : 10.1016/S0304-3975(02)00435-8
URL : http://doi.org/10.1016/s0304-3975(02)00435-8

R. Lenne, C. Solnon, T. Stutzle, E. Tannier, and M. Birattari, Reactive Stochastic Local Search Algorithms for the Genomic Median Problem, LNCS, vol.4972, pp.266-276, 2008.
DOI : 10.1007/978-3-540-78604-7_23
URL : https://hal.archives-ouvertes.fr/hal-00428150

Y. Lin, 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

L. Lu, Y. Huang, T. Wang, and H. Chiu, Analysis of circular genome rearrangement by fusions, fissions and block-interchanges, BMC Bioinformatics, vol.7, issue.1, p.295, 2006.
DOI : 10.1186/1471-2105-7-295

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

W. Murphy, Dynamics of Mammalian Chromosome Evolution Inferred from Multispecies Comparative Maps, Science, vol.309, issue.5734, pp.613-617, 2005.
DOI : 10.1126/science.1111387

M. Sagot and E. Tannier, Perfect Sorting by Reversals, COCOON 2005, pp.42-51, 2005.
DOI : 10.1007/11533719_7
URL : https://hal.archives-ouvertes.fr/hal-00427848

E. Tannier, A. Bergeron, and M. Sagot, Advances on sorting by reversals, Discrete Applied Mathematics, vol.155, issue.6-7, pp.881-888, 2007.
DOI : 10.1016/j.dam.2005.02.033
URL : https://hal.archives-ouvertes.fr/hal-00434657

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

R. Warren and D. Sankoff, Genome halving with double cut and join, APBC 2008, pp.231-240, 2008.

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