D. A. Bader, B. M. Moret, and M. Yan, A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study, Journal of Computational Biology, vol.8, issue.5, pp.483-491, 2001.
DOI : 10.1089/106652701753216503

S. Bérard, A. Bergeron, and C. Chauve, Conserved structures in evolution scenarios, Lecture Notes in Bioinformatics, vol.3388, pp.1-15, 2004.

S. Bérard, A. Bergeron, C. Chauve, and C. Paul, Perfect sorting by reversals is not always difficult, 2005.

A. Bergeron, M. Blanchette, and A. , Chateau and C. Chauve Reconstructing ancestral gene orders using conserved intervals, WABI 2004, pp.14-25, 2004.

A. Bergeron, C. Chauve, T. Hartman, and K. St-onge, On the properties of sequences of reversals that sort a signed permutation, pp.99-108, 2002.

A. Bergeron, J. Mixtacki, and J. Stoye, Reversal Distance without Hurdles and Fortresses, Lecture Notes in Comput. Sci, vol.3109, pp.388-399, 2004.
DOI : 10.1007/978-3-540-27801-6_29
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.4488

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

G. Bourque, P. A. Pevzner, and G. Tesler, Reconstructing the Genomic Architecture of Ancestral Mammals: Lessons From Human, Mouse, and Rat Genomes, Genome Research, vol.14, issue.4, pp.507-516, 2004.
DOI : 10.1101/gr.1975204

A. Caprara, Formulations and hardness of multiple sorting by reversals, Proceedings of the third annual international conference on Computational molecular biology , RECOMB '99, pp.84-94, 1999.
DOI : 10.1145/299432.299461

M. Chein, M. Habib, and M. C. Maurer, Partitive hypergraphs, Discrete Mathematics, vol.37, issue.1, pp.35-50, 1981.
DOI : 10.1016/0012-365X(81)90138-2
URL : http://doi.org/10.1016/0012-365x(81)90138-2

G. Didier, Common Intervals of Two Sequences, WABI 2003, pp.17-24, 2003.
DOI : 10.1007/978-3-540-39763-2_2

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

R. A. Gibbs, Genome sequence of the brown norway rat yields insights into mammalian evolution, Nature, vol.428, issue.6982, pp.493-521, 2004.

S. Heber and J. Stoye, Finding All Common Intervals of k Permutations, Lecture Notes in Comput. Sci, vol.2089, pp.207-218, 2001.
DOI : 10.1007/3-540-48194-X_19

G. M. Landau, L. Parida, and O. Weimann, Using PQ Trees for Comparative Genomics, CPM 2005, pp.128-143, 2005.
DOI : 10.1007/11496656_12

F. De, Montgolfier Décomposition modulaire des graphes. Théorie, extensions et algorithmes, 2003.

M. Sagot and E. Tannier, Perfect Sorting by Reversals, to be published in Lecture Notes in Comput. Sci.), 2005.
DOI : 10.1007/11533719_7
URL : https://hal.archives-ouvertes.fr/hal-00427848

T. Schmidt and J. Stoye, Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences, CPM 2004, pp.347-358, 2004.
DOI : 10.1007/978-3-540-27801-6_26

E. Tannier and M. Sagot, Sorting by Reversals in Subquadratic Time, Lecture Notes in Comput. Sci, vol.3109, pp.1-13, 2004.
DOI : 10.1007/978-3-540-27801-6_1
URL : https://hal.archives-ouvertes.fr/hal-00427659

G. Tesler, GRIMM: genome rearrangements web server, Bioinformatics, vol.18, issue.3, pp.492-493, 2002.
DOI : 10.1093/bioinformatics/18.3.492
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.620.7652

T. Uno and M. Yagiura, Fast Algorithms to Enumerate All Common Intervals of Two Permutations, Algorithmica, vol.26, issue.2, pp.290-309, 2000.
DOI : 10.1007/s004539910014