M. Ibrahim-abouelhoda, S. Kurtz, and E. Ohlebusch, Replacing suffix trees with enhanced suffix arrays, Journal of Discrete Algorithms, vol.2, issue.1, pp.53-86, 2004.
DOI : 10.1016/S1570-8667(03)00065-0

M. Babenko and T. Starikovskaya, Computing Longest Common Substrings Via Suffix Arrays, CSR 2008, 2008.
DOI : 10.1007/978-3-540-79709-8_10

V. Becher, A. Deymonnaz, and P. Heiber, Efficient computation of all perfect repeats in genomic sequences of up to half a gigabyte, with a case study on the human genome, Bioinformatics, vol.25, issue.14, p.25, 2009.
DOI : 10.1093/bioinformatics/btp321

V. Becher, A. Deymonnaz, and P. Heiber, Efficient repeat finding via suffix arrays. manuscript, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00980753

D. Gusfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, 1997.
DOI : 10.1017/CBO9780511574931

T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park, Linear-time longestcommon-prefix computation in suffix arrays and its applications, Proc.12th Annual Symposium on Combinatorial Pattern Matching, pp.181-192, 2001.

N. , J. Larsson, and K. Sadakane, Faster suffix sorting, Theoretical Computer Science, vol.387, issue.3, pp.258-272, 2007.
DOI : 10.1016/j.tcs.2007.07.017
URL : http://doi.org/10.1016/j.tcs.2007.07.017

U. Manber and G. Myers, Suffix Arrays: A New Method for On-Line String Searches, SODA '90: Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pp.935-948, 1990.
DOI : 10.1137/0222058

J. Simon, W. F. Puglisi, A. H. Smyth, and . Turpin, A taxonomy of suffix array construction algorithms, ACM Computing Surveys, vol.39, issue.2, p.4, 2007.