A. Apostolico and R. Giancarlo, The Boyer???Moore???Galil String Searching Strategies Revisited, SIAM Journal on Computing, vol.15, issue.1, pp.98-105, 1986.
DOI : 10.1137/0215007

R. Baeza-yates, C. Choffrut, and G. Gonnet, On Boyer-Moore automata, Algorithmica, vol.8, issue.1, pp.268-292, 1994.
DOI : 10.1007/BF01185428

H. Bannai, S. Inenaga, A. Shinohara, and M. Takeda, Inferring Strings from Graphs and Arrays, Mathematical Foundations of Computer Science, pp.208-217, 2003.
DOI : 10.1007/978-3-540-45138-9_15

R. S. Boyer and J. S. Moore, A fast string searching algorithm, Communications of the ACM, vol.20, issue.10, pp.762-772, 1977.
DOI : 10.1145/359842.359859

M. Crochemore, J. Désarménien, and D. Perrin, A note on the Burrows???Wheeler transformation, Theoretical Computer Science, vol.332, issue.1-3, pp.567-572, 2005.
DOI : 10.1016/j.tcs.2004.11.014
URL : https://hal.archives-ouvertes.fr/hal-00004249

M. Crochemore, C. Hancart, and T. Lecroq, Algorithms on Strings, 2007.
DOI : 10.1017/CBO9780511546853
URL : https://hal.archives-ouvertes.fr/hal-00470109

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, 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 T. Lecroq, Tight bounds on the complexity of the Apostolico-Giancarlo algorithm, Information Processing Letters, vol.63, issue.4, pp.195-203, 1997.
DOI : 10.1016/S0020-0190(97)00107-5
URL : https://hal.archives-ouvertes.fr/hal-00619574

J. Duval, T. Lecroq, and A. Lefebvre, Border array on bounded alphabet, Journal of Automata, Languages and Combinatorics, vol.10, issue.1, pp.51-60, 2005.

J. Duval, T. Lecroq, and A. Lefebvre, Efficient validation and construction of border arrays, Proceedings of 11th Mons Days of Theoretical Computer Science, pp.179-189, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00516728

F. Franek, S. Gao, W. Lu, P. J. Ryan, W. F. Smyth et al., Verifying a Border array in linear time, J. Combinatorial Math. and Combinatorial Computing, vol.42, pp.223-236, 2002.

F. Franek and W. F. Smyth, RECONSTRUCTING A SUFFIX ARRAY, International Journal of Foundations of Computer Science, vol.17, issue.06, pp.1281-1295, 2006.
DOI : 10.1142/S0129054106004418

Z. Galil and J. I. Seiferas, A Linear-Time On-Line Recognition Algorithm for ``Palstar'', Journal of the ACM, vol.25, issue.1, pp.102-111, 1978.
DOI : 10.1145/322047.322056

D. Gusfield, Algorithms on strings, trees and sequences: computer science and computational biology, 1997.
DOI : 10.1017/CBO9780511574931

C. Hancart, On Simon's string searching algorithm, Information Processing Letters, vol.47, issue.2, pp.95-99, 1993.
DOI : 10.1016/0020-0190(93)90231-W

D. E. Knuth, J. H. Jr, and V. R. Pratt, Fast Pattern Matching in Strings, SIAM Journal on Computing, vol.6, issue.2, pp.323-350, 1977.
DOI : 10.1137/0206024

G. Manacher, A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String, Journal of the ACM, vol.22, issue.3, pp.346-351, 1975.
DOI : 10.1145/321892.321896

W. F. Smyth, Computing Patterns in Strings, 2003.