P. Pevzner, Computational Molecular Biology -An Algorithmic Approach

G. Blanc, H. Ogata, C. Robert, S. Audic, K. Suhre et al., Reductive Genome Evolution from the Mother of Rickettsia, PLoS Genetics, vol.44, issue.1, pp.103-114, 2007.
DOI : 10.1371/journal.pgen.0030014.st005

S. Hannenhalli and P. Pevzner, Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals, Journal of the ACM, vol.46, issue.1, pp.1-27, 1999.
DOI : 10.1145/300515.300516

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

E. Tannier, A. Bergeron, and M. Sagot, Advances on Sorting by ReversalsA preliminary version appeared in CPM, Discrete Applied Mathematics Lecture Notes in Computer Science, vol.155, issue.3595, pp.6-7881, 2004.

D. Bader, B. Moret, and Y. M. , 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

A. Bergeron, J. Mixtacki, and J. Stoye, The inversion distance problem Mathematics of evolution and phylogeny, 2005.

Y. Han, Improving the Efficiency of Sorting by Reversals, Proceedings of The 2006 International Conference on Bioinformatics and Computational Biology CSREA Press, 2006.

B. Moret, S. Wyman, D. Bader, T. Warnow, and Y. M. , A New Implementation and Detailed Study of Breakpoint Analysis, Biocomputing 2001, pp.583-594, 2001.
DOI : 10.1142/9789814447362_0056

G. Tesler, GRIMM: genome rearrangements web server, Bioinformatics, vol.18, issue.3, pp.492-493, 2002.
DOI : 10.1093/bioinformatics/18.3.492

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-309, 2005.
DOI : 10.1109/TCBB.2007.1042
URL : https://hal.archives-ouvertes.fr/hal-00434588

S. Berard, A. Bergeron, and C. Chauve, Conserved structures in evolution scenarios, RCG Lecture Notes in Bioinformatics, vol.3388, pp.1-15, 2005.

S. Berard, 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
URL : https://hal.archives-ouvertes.fr/lirmm-00111979

A. Bergeron, S. Heber, and J. Stoye, Common intervals and sorting by reversals: a marriage of necessity, Bioinformatics, vol.18, issue.Suppl 2, pp.54-63, 2002.
DOI : 10.1093/bioinformatics/18.suppl_2.S54

A. Siepel, An Algorithm to Enumerate Sorting Reversals for Signed Permutations, Journal of Computational Biology, vol.10, issue.3-4, pp.575-597, 2003.
DOI : 10.1089/10665270360688200

A. Bergeron, C. Chauve, T. Hartmann, and K. St-onge, On the properties of sequences of reversals that sort a signed permutation, pp.99-108, 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, pp.348-356, 2007.
DOI : 10.1109/TCBB.2008.16
URL : https://hal.archives-ouvertes.fr/hal-00428206

M. Bernt, D. Merkle, and M. Middendorf, Using median sets for inferring phylogenetic trees, Bioinformatics, vol.23, issue.2, pp.129-135, 2007.
DOI : 10.1093/bioinformatics/btl300

M. Bader, M. Abouelhoda, and E. Ohlebusch, A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions, BMC Bioinformatics, vol.9, issue.1, p.516, 2008.
DOI : 10.1186/1471-2105-9-516

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

S. Heber and J. Stoye, Finding All Common Intervals of k Permutations, Combinatorial Pattern Matching, 12th Annual Symposium, pp.207-218, 2001.
DOI : 10.1007/3-540-48194-X_19

M. Braga, baobabLUNA: the solution space of sorting by reversals, Bioinformatics, vol.25, issue.14, pp.1833-1835, 2009.
DOI : 10.1093/bioinformatics/btp285
URL : https://hal.archives-ouvertes.fr/hal-00539408