J. Berstel and A. Savelli, Crochemore Factorization of Sturmian and Other Infinite Words, Mathematical Foundations of Computer Science, pp.157-166, 2006.
DOI : 10.1007/11821069_14

URL : https://hal.archives-ouvertes.fr/hal-00620160

M. Crochemore, Transducers and repetitions, Theoretical Computer Science, vol.45, issue.1, pp.63-86, 1986.
DOI : 10.1016/0304-3975(86)90041-1

URL : https://hal.archives-ouvertes.fr/hal-00619540

M. Crochemore and L. Ilie, Computing Longest Previous Factor in linear time and applications, Information Processing Letters, vol.106, issue.2, pp.75-80, 2008.
DOI : 10.1016/j.ipl.2007.10.006

URL : https://hal.archives-ouvertes.fr/hal-00619691

M. Crochemore, L. Ilie, C. Iliopoulos, M. Kubica, W. Rytter et al., LPF Computation Revisited, Proc. of IWOCA 2009, pp.158-169, 2009.
DOI : 10.1007/978-3-642-10217-2_18

URL : https://hal.archives-ouvertes.fr/hal-00741881

M. Crochemore, L. Ilie, and W. F. Smyth, A Simple Algorithm for Computing the Lempel Ziv Factorization, Data Compression Conference (dcc 2008), pp.482-488, 2008.
DOI : 10.1109/DCC.2008.36

URL : https://hal.archives-ouvertes.fr/hal-00620138

M. Crochemore and W. Rytter, Jewels of Stringology, p.310, 2002.
DOI : 10.1142/4838

URL : https://hal.archives-ouvertes.fr/hal-00619795

F. Franek, J. Holub, W. F. Smyth, and X. Xiao, Computing quasi suffix arrays, J. Autom. Lang. Comb, vol.8, issue.4, pp.593-606, 2003.

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

J. Kärkkäinen and P. Sanders, Simple Linear Work Suffix Array Construction, Automata, Languages and Programming, pp.943-955, 2003.
DOI : 10.1007/3-540-45061-0_73

T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park, Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications, Combinatorial Pattern Matching, pp.181-192, 2001.
DOI : 10.1007/3-540-48194-X_17

URL : http://www.cs.iastate.edu/~cs548/references/linear_lcp.pdf

D. K. Kim, J. S. Sim, H. Park, and K. Park, Linear-Time Construction of Suffix Arrays, Combinatorial Pattern Matching, pp.186-199, 2003.
DOI : 10.1007/3-540-44888-8_14

URL : http://alumni.cs.ucr.edu/~rakthant/cs234/03_KSPP Linear Time Construction of Suffix Arrays.pdf

P. Ko and S. Aluru, Space efficient linear time construction of suffix arrays, Combinatorial Pattern Matching Lecture Notes in Computer Science, vol.2676, pp.200-210, 2003.
DOI : 10.1007/3-540-44888-8_15

R. M. Kolpakov and G. Kucherov, Finding maximal repetitions in a word in linear time, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), pp.596-604, 1999.
DOI : 10.1109/SFFCS.1999.814634

URL : https://hal.archives-ouvertes.fr/inria-00098853

M. G. Main, Detecting leftmost maximal periodicities, Discrete Applied Mathematics, vol.25, issue.1-2, pp.145-153, 1989.
DOI : 10.1016/0166-218X(89)90051-6

URL : https://doi.org/10.1016/0166-218x(89)90051-6

U. Manber and G. 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

URL : http://webglimpse.net/pubs/suffix.pdf

E. M. Mccreight, A Space-Economical Suffix Tree Construction Algorithm, Journal of the ACM, vol.23, issue.2, pp.262-272, 1976.
DOI : 10.1145/321941.321946

G. Nong, S. Zhang, and W. H. Chan, Linear Time Suffix Array Construction Using D-Critical Substrings, Combinatorial Pattern Matching, pp.54-67, 2009.
DOI : 10.1109/DCC.2009.42

M. Rodeh, V. R. Pratt, and S. Even, Linear Algorithm for Data Compression via String Matching, Journal of the ACM, vol.28, issue.1, pp.16-24, 1981.
DOI : 10.1145/322234.322237

J. Storer and T. Szymanski, Data compression via textural substitution, Journal of the ACM, vol.29, issue.4, pp.928-951, 1982.
DOI : 10.1145/322344.322346

J. Ziv and A. , A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, vol.23, issue.3, pp.337-343, 1977.
DOI : 10.1109/TIT.1977.1055714

URL : http://www.ece.gatech.edu/users/swm/0337ziv.pdf

J. Ziv and A. , Compression of individual sequences via variable-rate coding, IEEE Transactions on Information Theory, vol.24, issue.5, pp.530-536, 1978.
DOI : 10.1109/TIT.1978.1055934