]. A. Bbh-+-85, J. Blumer, D. Blumer, A. Haussler, M. T. Ehrenfeucht et al., The smallest automaton recognizing the subwords of a text, Theoretical Computer Science, vol.40, pp.31-55, 1985.

J. [. Coffman and . Eve, File structures using hashing functions, Communications of the ACM, vol.13, issue.7, pp.427-432, 1970.
DOI : 10.1145/362686.362693

C. [. Cormen, R. Leiserson, and . Rivest, Introduction to Algorithms, 1999.

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

]. M. Cro86 and . Crochemore, Transducers and repetitions, Theoretical Computer Science, vol.45, pp.63-86, 1986.

]. M. Cro88 and . Crochemore, String matching with constraints, Proceedings International Symposium on Mathematical Foundations of Computer Science, pp.44-58, 1988.

R. [. Ehrenfeucht, N. Mcconnell, S. Osheim, and . Woo, Position heaps: A simple and dynamic text indexing data structure, Preliminary version in Proc. 20th Anniversary Edition of the Annual Symposium on Combinatorial Pattern Matching, pp.100-121, 2009.
DOI : 10.1016/j.jda.2010.12.001

]. E. Fre60 and . Fredkin, Trie memory, Communications of the ACM, vol.3, issue.9, pp.490-499, 1960.

D. [. Gusfield, V. Munro, and . Raman, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology Succinct representation of balanced parentheses and static trees, Ukk95] E. Ukkonen. On-line construction of suffix-trees. Algorithmica, pp.762-776, 1995.
DOI : 10.1017/CBO9780511574931

]. P. Wei73 and . Weiner, Linear pattern matching algorithm, 14th Annual IEEE Symposium on Switching and Automata Theory, pp.1-11, 1973.