R. M. Aiex, S. Binato, and M. G. Resende, Parallel GRASP with path-relinking for job shop scheduling, Parallel Computing, vol.29, issue.4, 2002.
DOI : 10.1016/S0167-8191(03)00014-0

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

T. Bäck, Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms, 1996.

V. Bafna and P. A. Pevzner, Sorting by reversals: Genome rearrangements in plant organelles and evolutionary history of X chromosome, Molecular Biology and Evolution, vol.12, issue.2, pp.239-246, 1995.

V. Bafna and P. A. Pevzner, Sorting by Transpositions, SIAM Journal on Discrete Mathematics, vol.11, issue.2, pp.224-240, 1998.
DOI : 10.1137/S089548019528280X

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

A. Bergeron, A very elementary presentation of the Hannenhalli?Pevzner theory, Discrete Applied Mathematics, vol.146, issue.2, pp.134-145, 2005.
DOI : 10.1016/j.dam.2004.04.010

L. Bulteau, G. Fertin, and I. Rusu, Pancake Flipping Is Hard, Mathematical Foundations of Computer Science 2012, pp.247-258
DOI : 10.1007/978-3-642-32589-2_24

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

L. Bulteau, G. Fertin, and U. Rusu, Sorting by Transpositions Is Difficult, Automata, Languages and Programming, pp.654-665, 2011.
DOI : 10.1007/3-540-45452-7_9

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

R. G. Cano, G. Kunigami, C. C. Souza, and P. J. Rezende, A hybrid GRASP heuristic to construct effective drawings of proportional symbol maps, Computers & Operations Research, vol.40, issue.5, pp.1435-1447, 2013.
DOI : 10.1016/j.cor.2012.09.007

A. E. Darling, I. Miklós, and M. A. Ragan, Dynamics of Genome Rearrangement in Bacterial Populations, PLoS Genetics, vol.3, issue.6, p.1000128, 2008.
DOI : 10.1371/journal.pgen.1000128.s009

U. Dias and Z. Dias, Sorting genomes using symmetric, almost-symmetric and unitary inversions, Proceedings of the 5th International Conference on Bioinformatics and Computational Biology (BICoB'2013), pp.261-268, 2013.
DOI : 10.1145/2245276.2231993

U. Dias, Z. Dias, and J. C. Setubal, A Simulation Tool for the Study of Symmetric Inversions in Bacterial Genomes, Comparative Genomics, pp.240-251, 2011.
DOI : 10.1007/978-3-642-16181-0_20

Z. Dias, U. Dias, J. C. Setubal, and L. S. Heath, Sorting genomes using almost-symmetric inversions, Proceedings of the 27th Annual ACM Symposium on Applied Computing, SAC '12, pp.1-7, 2012.
DOI : 10.1145/2245276.2231993

T. Dobzhansky and A. H. Sturtevant, Inversions in the third chromosome of wild races of Drosophila pseudoobscura, and their use in the study of the history of the species, Proceedings of the National Academy of Science, vol.22, pp.448-450, 1936.

J. A. Eisen, J. F. Heidelberg, O. White, and S. L. Salzberg, Evidence for symmetric chromosomal inversions around the replication origin in bacteria, Genome Biology, vol.19, issue.6, pp.11-12, 2000.

I. Elias, T. Hartmn, and M. G. Resende, A 1.375-Approximation Algorithm for Sorting by Transpositions, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.3, issue.4, pp.369-379109, 1995.
DOI : 10.1109/TCBB.2006.44

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

T. A. Feo and M. Pardalos, A greedy randomized adaptive search procedure for the 2-partition problem, Operations Research, 1994.

P. Festa and M. Resende, GRASP: basic components and enhancements, Telecommunication Systems, vol.24, issue.1, pp.253-271, 2011.
DOI : 10.1016/S0167-8191(05)80147-4

J. Fischer and S. W. Ginzinger, A 2-Approximation Algorithm for Sorting by Prefix Reversals, Proceedings of the 13th Annual European Symposium on Algorithms (ESA'2005), pp.415-425, 2005.
DOI : 10.1007/11561071_38

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

S. Hannenhalli and P. A. 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

J. D. Kececioglu and R. Ravi, Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with Translocation, Proceedings of the 6th Annual Symposium on Discrete Algorithms, pp.604-613, 1995.

S. Kurtz, A. Phillippy, A. L. Delcher, M. Smoot, M. Shumway et al., Versatile and open software for comparing large genomes, Genome Biology, vol.5, issue.2, p.12, 2004.
DOI : 10.1186/gb-2004-5-2-r12

M. Laguna and R. Martí, GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization, INFORMS Journal on Computing, vol.11, issue.1, pp.44-52, 1999.
DOI : 10.1287/ijoc.11.1.44

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

E. Ohlebusch, M. I. Abouelhoda, K. Hockel, and J. Stallkamp, The Median Problem for the Reversal Distance in Circular Bacterial Genomes, Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM'2005), pp.116-127, 2005.
DOI : 10.1007/11496656_11

J. D. Palmer and L. A. Herbon, Plant mitochondrial DNA evolves rapidly in structure, but slowly in sequence, Journal of Molecular Evolution, vol.27, pp.87-97, 1988.
DOI : 10.1007/bf02143500

M. Prais and C. C. Ribeiro, Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment, INFORMS Journal on Computing, vol.12, issue.3, pp.164-176, 1998.
DOI : 10.1287/ijoc.12.3.164.12639

C. C. Ribeiro, E. Uchoa, and R. F. Werneck, A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs, INFORMS Journal on Computing, vol.14, issue.3, pp.200-202, 2001.
DOI : 10.1287/ijoc.14.3.228.116

C. Rooney, N. Taylor, J. Countryman, H. Jenson, J. Kolman et al., Genome rearrangements activate the Epstein-Barr virus gene whose product disrupts latency., Proceedings of the National Academy of Sciences, vol.85, issue.24, pp.9801-9806, 1988.
DOI : 10.1073/pnas.85.24.9801

URL : https://www.ncbi.nlm.nih.gov/pmc/articles/PMC282869/pdf

E. Tannier and M. Sagot, Sorting by Reversals in Subquadratic Time, Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching, pp.1-13, 2004.
DOI : 10.1007/978-3-540-27801-6_1

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