I. Dunham, A. Hunt, J. Collins, R. Bruskiewich, D. Beare et al., The DNA sequence of human chromosome 22, Nature, vol.191, issue.6761, pp.402489-495, 1999.
DOI : 10.1016/S0378-1119(97)00044-9

J. Kärkkäinen, P. Sanders, J. K. Baeten, J. Lenstra, G. J. Parrow et al., Simple Linear Work Suffix Array Construction, Automata, Languages and Programming, 30th International Colloquium, ICALP 2003 Proceedings, volume 2719 of Lecture Notes in Computer Science, pp.943-955, 2003.
DOI : 10.1007/3-540-45061-0_73

D. K. Kim, J. S. Sim, H. Park, and K. Park, Linear-Time Construction of Suffix Arrays, Baeza-Yates et al. [1], pp.186-199
DOI : 10.1007/3-540-44888-8_14

P. Ko and S. Aluru, Space efficient linear time construction of suffix arrays, Baeza-Yates et al. [1], pp.200-210

D. A. Levin, Y. Peres, and E. L. Wilmer, Markov chains and mixing times, 2009.
DOI : 10.1090/mbk/058

U. Manber and E. W. Myers, Suffix Arrays: A New Method for On-Line String Searches, SIAM Journal on Computing, vol.22, issue.5, pp.935-948, 1993.
DOI : 10.1137/0222058

U. Manber and G. Myers, Suffix Arrays: A New Method for On-Line String Searches, Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp.22-24, 1990.
DOI : 10.1137/0222058

G. Nong, S. Zhang, and W. H. Chan, Two Efficient Algorithms for Linear Time Suffix Array Construction, IEEE Transactions on Computers, vol.60, issue.10, pp.601471-1484, 2011.
DOI : 10.1109/TC.2010.188

J. R. Norris, Markov chains. Cambridge series in statistical and probabilistic mathematics, 1998.

M. Powell, The Canterbury Corpus, 2001.

S. J. Puglisi, W. F. Smyth, and A. Turpin, A taxonomy of suffix array construction algorithms, ACM Computing Surveys, vol.39, issue.2, 2007.
DOI : 10.1145/1242471.1242472

B. Vallée, Dynamical sources in information theory: Fundamental intervals and word prefixes, Algorithmica, vol.81, issue.2, pp.262-306, 2001.
DOI : 10.1002/j.1538-7305.1948.tb01338.x