C. Allauzen, M. Crochemore, and M. Raffinot, Efficient Experimental String Matching by Weak Factor Recognition*, Combinatorial Pattern Matching, pp.51-72, 2001.
DOI : 10.1007/3-540-48194-X_5
URL : https://hal.archives-ouvertes.fr/hal-00619845

R. Baeza-yates and G. H. Gonnet, A new approach to text searching, Communications of the ACM, vol.35, issue.10, pp.74-82, 1992.
DOI : 10.1145/135239.135243

R. A. Baeza-yates and M. Régnier, Average running time of the Boyer-Moore-Horspool algorithm, Theoretical Computer Science, vol.92, issue.1, pp.19-31, 1992.
DOI : 10.1016/0304-3975(92)90133-Z

G. Barth, An analytical comparison of two string searching algorithms, Information Processing Letters, vol.18, issue.5, pp.249-256, 1984.
DOI : 10.1016/0020-0190(84)90003-6

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, Handbook of Exact String Matching Algorithms. King's College Publications, 2004.

T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms, 1990.

G. Didier, Optimal pattern matching algorithms, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01310164

S. Faro and T. Lecroq, EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM, International Journal of Foundations of Computer Science, vol.20, issue.06, pp.967-984, 2009.
DOI : 10.1142/S0129054109006991
URL : https://hal.archives-ouvertes.fr/hal-00469170

S. Faro and T. Lecroq, The exact online string matching problem, ACM Computing Surveys, vol.45, issue.2, pp.13-14, 2013.
DOI : 10.1145/2431211.2431212

F. Franek, C. G. Jennings, and W. F. Smyth, A simple fast hybrid patternmatching algorithm, Combinatorial Pattern Matching, pp.288-297, 2005.

L. Guibas and A. Odlyzko, String overlaps, pattern matching, and nontransitive games, Journal of Combinatorial Theory, Series A, vol.30, issue.2, pp.183-208, 1981.
DOI : 10.1016/0097-3165(81)90005-4

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

R. M. Karp and M. O. Rabin, Efficient randomized pattern-matching algorithms, IBM Journal of Research and Development, vol.31, issue.2, pp.249-260, 1987.
DOI : 10.1147/rd.312.0249

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

H. M. Mahmoud, R. T. Smythe, and M. Régnier, Analysis of Boyer- Moore-Horspool string-matching heuristic. Random Struct, Algorithms, vol.10, issue.12, pp.169-186, 1997.

T. Marschall, I. Herms, H. Kaltenbach, and S. Rahmann, Probabilistic Arithmetic Automata and Their Applications, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.9, issue.6, pp.1737-1750, 2012.
DOI : 10.1109/TCBB.2012.109

T. Marschall and S. Rahmann, Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics, Combinatorial Pattern Matching, pp.95-106, 2008.
DOI : 10.1007/978-3-540-69068-9_11

T. Marschall and S. Rahmann, Exact Analysis of Horspool???s and Sunday???s Pattern Matching Algorithms with Probabilistic Arithmetic Automata, Language and Automata Theory and Applications, pp.439-450, 2010.
DOI : 10.1007/978-3-642-13089-2_37

T. Marschall and S. Rahmann, An Algorithm to Compute the Character Access Count Distribution for Pattern Matching Algorithms, Algorithms, vol.4, issue.4, p.285, 2011.
DOI : 10.3390/a4040285

M. Régnier and W. Szpankowski, Complexity of Sequential Pattern Matching Algorithms, Randomization and Approximation Techniques in Computer Science, pp.187-199, 1998.
DOI : 10.1007/3-540-49543-6_16

R. T. Smythe, The Boyer-Moore-Horspool heuristic with Markovian input. Random Struct, Algorithms, vol.18, issue.2, pp.153-163, 2001.

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. Thathoo, A. Virmani, S. Sai-lakshmi, N. Balakrishnan, and K. Sekar, TVSBS: A fast exact pattern matching algorithm for biological sequences, Current Science, vol.91, issue.1, pp.47-53, 2006.

T. Tsai, Average Case Analysis of the Boyer-Moore Algorithm. Random Struct, Algorithms, vol.28, issue.4, pp.481-498, 2006.

S. Wu and U. Manber, A fast algorithm for multi-pattern searching, 1994.

A. C. Yao, The Complexity of Pattern Matching for a Random String, SIAM Journal on Computing, vol.8, issue.3, pp.368-387, 1979.
DOI : 10.1137/0208029