R. Arratia, L. Goldstein, and L. Gordon, Two Moments Suffice for Poisson Approximations: The Chen-Stein Method, The Annals of Probability, vol.17, issue.1, pp.9-25, 1989.
DOI : 10.1214/aop/1176991491

R. Arratia, L. Goldstein, and L. Gordon, Poisson approximation and the Chen-Stein method, Statistical Science, vol.5, pp.403-424, 1990.

Y. Baryshnikov and R. Pemantle, Convolutions of inverse linear functions via multivariate residues

A. Bergeron and J. Stoye, On the Similarity of Sets of Permutations and Its Applications to Genome Comparison, Lecture Notes in Computer Science, vol.2697, pp.68-79, 2003.
DOI : 10.1007/3-540-45071-8_9

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

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

K. S. Booth and G. S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, Journal of Computer and System Sciences, vol.13, issue.3, pp.335-379, 1976.
DOI : 10.1016/S0022-0000(76)80045-1

G. Didier, Common Intervals of Two Sequences, Lecture Notes in Computer Science, vol.2812, pp.17-24, 2003.
DOI : 10.1007/978-3-540-39763-2_2

S. Heber and J. Stoye, Algorithms for Finding Gene Clusters, Lecture Notes in Computer Science, vol.2149, pp.252-263, 2001.
DOI : 10.1007/3-540-44696-6_20

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

I. Kaplansky, The Asymptotic Distribution of Runs of Consecutive Elements, The Annals of Mathematical Statistics, vol.16, issue.2, pp.200-203, 1945.
DOI : 10.1214/aoms/1177731121

S. Kobayashi, I. Ono, and M. Yamamura, An Efficient Genetic Algorithm for Job Shop Scheduling Problems, ICGA, vol.1995, pp.506-511, 1995.

H. Mühlenbein, M. Gorges-schleuter, and O. Krämer, Evolution algorithms in combinatorial optimization, Parallel Computing, vol.7, issue.1, pp.65-85, 1988.
DOI : 10.1016/0167-8191(88)90098-1

R. Pemantle and M. Wilson, Asymptotics of Multivariate Sequences, Journal of Combinatorial Theory, Series A, vol.97, issue.1, pp.129-161, 2001.
DOI : 10.1006/jcta.2001.3201

R. Pemantle and M. Wilson, Asymptotics of Multivariate Sequences II: Multiple Points of the Singular Variety, Combinatorics, Probability and Computing, vol.13, issue.4-5, pp.735-761, 2004.
DOI : 10.1017/S0963548304006248

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

J. Wolfowitz, Additive Partition Functions and a Class of Statistical Hypotheses, The Annals of Mathematical Statistics, vol.13, issue.3, pp.247-279, 1942.
DOI : 10.1214/aoms/1177731566

J. Wolfowitz, Note on Runs of Consecutive Elements, The Annals of Mathematical Statistics, vol.15, issue.1, pp.97-98, 1944.
DOI : 10.1214/aoms/1177731319