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. 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

C. Charras and T. Lecroq, Exact string matching algorithms Available at URL: http

R. Cole, Tight Bounds on the Complexity of the Boyer???Moore String Matching Algorithm, SIAM Journal on Computing, vol.23, issue.5, pp.1075-1091, 1994.
DOI : 10.1137/S0097539791195543

M. Crochemore, A. Czumaj, L. Ga¸sieniecga¸sieniec, S. Jarominek, T. Lecroq et al., Speeding up two string-matching algorithms, Algorithmica, vol.8, issue.11, pp.247-267, 1994.
DOI : 10.1007/BF01185427
URL : https://hal.archives-ouvertes.fr/hal-00619553

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

M. Crochemore and W. Rytter, Text algorithms, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00619796

Z. Galil, On improving the worst case running time of the Boyer-Moore string matching algorithm, Communications of the ACM, vol.22, issue.9, pp.505-508, 1979.
DOI : 10.1145/359146.359148

L. J. Guibas and A. M. Odlyzko, A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm, SIAM Journal on Computing, vol.9, issue.4, pp.672-682, 1980.
DOI : 10.1137/0209051

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

C. Hancart, Analyse exacte et en moyenne d'algorithmes de recherche d'un motif dans un texte, Thèse de doctorat, 1993.

R. N. Horspool, Practical fast searching in strings. Software?Practice and Experience, pp.501-506, 1980.

A. Hume and D. M. Sunday, Fast string searching. Software?Practice and Experience, pp.1221-1248, 1991.
DOI : 10.1002/spe.4380211105

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

C. Menico, Faster string searches, Dr. Dobbs J, pp.74-75, 1989.

J. Prosise, High-performance string searching: How a smart algorithm can make a big difference, PC Magazine, 1996.

W. Rytter, A Correct Preprocessing Algorithm for Boyer???Moore String-Searching, SIAM Journal on Computing, vol.9, issue.3, pp.509-512, 1980.
DOI : 10.1137/0209037

R. Schaback, On the Expected Sublinearity of the Boyer???Moore Algorithm, SIAM Journal on Computing, vol.17, issue.4, pp.648-658, 1988.
DOI : 10.1137/0217041

G. A. Stephen, String searching algorithms, 1994.
DOI : 10.1142/2418

D. M. Sunday, A very fast substring search algorithm, Communications of the ACM, vol.33, issue.8, pp.132-142, 1990.
DOI : 10.1145/79173.79184

R. F. Zhu and T. Takaoka, On improving the average case of the Boyer?Moore string matching algorithm, J. Inform. Process, vol.10, issue.3, pp.173-177, 1987.