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

V. Bafna and P. Pevzner, Genome Rearrangements and Sorting by Reversals, SIAM Journal on Computing, vol.25, issue.2, pp.272-289, 1996.
DOI : 10.1137/S0097539793250627

A. Barbour, L. Chen, and W. Loh, Compound Poisson approximation for nonnegative random variables via Stein's method. The Annals of Probability, pp.1843-1866, 1992.

A. Barbour and A. Xia, Estimating Stein's Constants for Compound Poisson Approximation, Bernoulli, vol.6, issue.4, pp.581-590, 2000.
DOI : 10.2307/3318506

A. Bergeron, S. Corteel, and M. Raffinot, The Algorithmic of Gene Teams, Lecture Notes in Computer Science, vol.2452, pp.464-476, 2002.
DOI : 10.1007/3-540-45784-4_36

B. Bollobas, Random Graphs, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00914127

A. Caprara, On the tightness of the alternating-cycle lower bound for sorting by reversals, Journal of Combinatorial Optimization, vol.3, issue.2/3, pp.149-182, 1999.
DOI : 10.1023/A:1009838309166

D. A. Christie, Sorting permutations by block-interchanges, Information Processing Letters, vol.60, issue.4, pp.165-169, 1996.
DOI : 10.1016/S0020-0190(96)00155-X

L. Comtet, Advanced Combinatorics : The Art of Finite and Infinite Expansions, 1974.
DOI : 10.1007/978-94-010-2196-8

E. Danchin and P. Pontarotti, Statistical Evidence for a More Than 800-Million-Year-Old Evolutionarily Conserved Genomic Region in Our Genome, Journal of Molecular Evolution, vol.298, issue.Suppl 1, pp.587-597, 2004.
DOI : 10.1007/s00239-004-2648-1

P. Diaconis, Group Representations in Probability and Statistics, Inst. Math. Stat, 1988.

J. Doignon and A. Labarre, On Hultman numbers, Journal of Integer Sequences, vol.10, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00728923

D. Durand and D. Sankoff, Tests for Gene Clustering, Journal of Computational Biology, vol.10, issue.3-4, pp.453-482, 2003.
DOI : 10.1089/10665270360688129

N. Eriksen and A. Hultman, Estimating the expected reversal distance after a fixed number of reversals, Advances in Applied Mathematics, vol.32, issue.3, pp.439-453, 2004.
DOI : 10.1016/S0196-8858(03)00054-X

J. C. Fu and M. V. Koutras, Distribution Theory of Runs: A Markov Chain Approach, Journal of the American Statistical Association, vol.11, issue.427, pp.1050-1058, 1994.
DOI : 10.1214/aoms/1177731421

J. Glaz and J. Naus, Multiple clusters on the line, Communications in Statistics - Theory and Methods, vol.111, issue.17, pp.1961-1986, 1983.
DOI : 10.1090/S0002-9904-1948-08936-4

J. Glaz, J. Naus, M. Roos, and S. Wallenstein, Poisson approximations for the distribution and moments of ordered m-spacings, Journal of Applied Probability, vol.41, issue.A, pp.271-281, 1994.
DOI : 10.1080/01621459.1985.10478198

J. Glaz, J. Naus, and S. Wallenstein, Scan Statistics, 2001.

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

S. Heber and J. Stoye, Finding all commun intervals of k permutations, Proceedings of CPM01, pp.207-218, 2001.

R. Hoberman and D. Durand, The Incompatible Desiderata of Gene Cluster Properties, Lecture Notes in Bioinformatics, vol.3678, pp.73-87, 2005.
DOI : 10.1007/11554714_7

R. Hoberman, D. Sankoff, and D. Durand, The Statistical Analysis of Spatially Clustered Genes under the Maximum Gap Criterion, Journal of Computational Biology, vol.12, issue.8, pp.1083-1102, 2005.
DOI : 10.1089/cmb.2005.12.1083

R. J. Huntington and J. Naus, A simpler expression for kth nearest neighbor coincidence probabilities. The Annals of Probability 3, pp.894-896, 1975.

H. Kaplan, R. Shamir, and R. E. Tarjan, Faster and simpler algorithm for sorting signed permutations by reversals, Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.344-351, 1997.

J. Kececioglu and D. Sankoff, Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement, Algorithmica, vol.84, issue.4, pp.180-210, 1995.
DOI : 10.1007/BF01188586

Z. Li, L. Wang, and K. Zhang, Algorithmic approaches for genome rearrangement : a review, IEEE Transactions on Systems, Man and Cybernetics Part C, vol.36, pp.636-648, 2006.

J. Naus, Probabilities for a Generalized Birthday Problem, Journal of the American Statistical Association, vol.1, issue.347, pp.810-815, 1974.
DOI : 10.1080/01621459.1974.10480190

N. Raghupathy and D. Durand, Individual Gene Cluster Statistics in Noisy Maps, Lecture Notes in Bioinformatics, vol.3678, pp.106-120, 2005.
DOI : 10.1007/11554714_10

M. Roos, Stein-Chen method for compound Poisson approximation, 1993.

M. Roos, Compound poisson approximations for the numbers of extreme spacings, Advances in Applied Probability, vol.1, issue.04, pp.847-874, 1993.
DOI : 10.2307/1427198

D. Sankoff and L. Haque, Power Boosts for Cluster Tests, Lecture Notes in Computer Science, vol.3678, pp.121-130, 2005.
DOI : 10.1007/11554714_11

D. Sankoff and L. Haque, The Distribution of Genomic Distance between Random Genomes, Journal of Computational Biology, vol.13, issue.5, pp.1005-1012, 2006.
DOI : 10.1089/cmb.2006.13.1005

W. Xu, C. Zheng, and D. Sankoff, Paths and cycles in breakpoint graphs of random multichromosomal genomes, Lecture Notes in Bioinformatics, vol.4205, pp.51-62, 2006.