A. V. Aho, Algorithms for nding patterns in strings, pp.255-300, 1990.

A. V. Aho and M. J. Corasick, Efficient string matching: an aid to bibliographic search, Communications of the ACM, vol.18, issue.6, pp.333-340, 1975.
DOI : 10.1145/360825.360855

A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The design and analysis of computer algorithms, 1974.

A. V. Aho, R. Sethi, and J. D. Ullman, Compilers { Principles, techniques and tools, 1986.

A. Amir and M. Farach, Adaptative dictionary matching, Proceedings of the 32th IEEE Annual Symposium on Foundations of Computer Science, pp.760-766, 1991.

A. Amir, M. Farach, Z. Galil, R. Giancarlo, and K. Park, Dynamic dictionary matching, Journal of Computer and System Sciences, vol.49, issue.2, pp.208-222, 1994.
DOI : 10.1016/S0022-0000(05)80047-9
URL : http://doi.org/10.1016/s0022-0000(05)80047-9

S. Baase, Computer algorithms { Introduction to design and analysis, 1988.

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

A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, M. T. Chen et al., The smallest automation recognizing the subwords of a text, Theoretical Computer Science, vol.40, pp.31-55, 1985.
DOI : 10.1016/0304-3975(85)90157-4

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

D. Breslauer, Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries, Journal of Algorithms, vol.18, issue.2, pp.278-295, 1995.
DOI : 10.1006/jagm.1995.1011
URL : https://hal.archives-ouvertes.fr/inria-00070010

D. Breslauer, L. Colussi, and L. Toniolo, Tight comparison bounds for the string prefix-matching problem, Information Processing Letters, vol.47, issue.1, pp.51-57, 1993.
DOI : 10.1016/0020-0190(93)90156-4

V. Bruy-ere, Automates de Boyer-Moore. Th ese annexe, 1991.

B. Commentz-walter, A string matching algorithm fast on the average, Proceedings of the 6th International Conference on Automata, Languages and Programmation, pp.118-132, 1979.
DOI : 10.1007/3-540-09510-1_10

T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to algorithms, 1990.

M. Crochemore, Transducers and repetitions, Theoretical Computer Science, vol.45, pp.63-86, 1986.
DOI : 10.1016/0304-3975(86)90041-1
URL : https://hal.archives-ouvertes.fr/hal-00619540

M. Crochemore, String-matching on ordered alphabets, Theoretical Computer Science, vol.92, issue.1, pp.33-47, 1992.
DOI : 10.1016/0304-3975(92)90134-2
URL : https://hal.archives-ouvertes.fr/hal-00619519

M. Crochemore and D. Perrin, Two-way string-matching, Journal of the ACM, vol.38, issue.3, pp.651-675, 1991.
DOI : 10.1145/116825.116845
URL : https://hal.archives-ouvertes.fr/hal-00619582

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

Z. Galil, String Matching in Real Time, Journal of the ACM, vol.28, issue.1, pp.134-149, 1981.
DOI : 10.1145/322234.322244

Z. Galil and J. Seiferas, Time-space-optimal string matching, Journal of Computer and System Sciences, vol.26, issue.3, pp.280-294, 1983.
DOI : 10.1016/0022-0000(83)90002-8
URL : http://doi.org/10.1016/0022-0000(83)90002-8

L. , W. Plandowski, and W. Rytter, The zooming method: a recursive approach to time-space eecient string-matching, Theoretical Computer Science, vol.147, pp.19-30, 1995.

G. H. Gonnet and R. A. Baeza-yates, Handbook of algorithms and data structures, 1991.

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

R. M. Idury and A. A. Schh-aaer, Dynamic dictionary matching with failure functions, Theoretical Computer Science, vol.131, issue.2, pp.295-310, 1994.
DOI : 10.1016/0304-3975(94)90176-7

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

G. Kucherov and M. Rusinowitch, Matching a set of strings with variable length don't cares, Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching, number 937 in Lecture Notes in Computer Science, 1995.

E. M. Mccreight, A space-economical suux tree construction algorithm, Journal of Algorithms, vol.23, pp.262-272, 1976.

D. Perrin, Finite Automata, pp.1-57, 1990.
DOI : 10.1016/B978-0-444-88074-1.50006-8
URL : https://hal.archives-ouvertes.fr/hal-00620817

I. Simon, String matching algorithms and automata. In Results and Trends in Theoretical Computer Science, number 814 in Lecture Notes in Computer Science, pages 386{395, 1994.
DOI : 10.1007/3-540-58131-6_61
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.9971

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

K. Thompson, Programming Techniques: Regular expression search algorithm, Communications of the ACM, vol.11, issue.6, pp.419-422, 1968.
DOI : 10.1145/363347.363387

E. Ukkonen, Constructing suux trees on-line in linear time, Proceedings of the IFIP 12th World Computer Congress, pp.484-492, 1992.

M. S. Waterman, Introduction to computational biology, 1995.
DOI : 10.1007/978-1-4899-6846-3

P. Weiner, Linear pattern matching algorithms, 14th Annual Symposium on Switching and Automata Theory (swat 1973), pp.1-11, 1973.
DOI : 10.1109/SWAT.1973.13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.474.9582