A. Apostolico, The Myriad Virtues of Subword Trees, Combinatorial Algorithms on Words., pages 85{95, 1985.
DOI : 10.1007/978-3-642-82456-2_6

A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, and R. Mcconnel, Linear size nite automata for the set of all subwords of a word: an outline of results, Bull. European Assoc. Theoret. Comput. Sci, vol.21, pp.12-20, 1983.

A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, 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

A. Blumer, J. Blumer, D. Haussler, and R. Mcconnell, Complete inverted files for efficient text retrieval and analysis, Journal of the ACM, vol.34, issue.3, pp.578-595, 1987.
DOI : 10.1145/28869.28873

A. Blumer, D. Haussler, and A. Ehrenfeucht, Average sizes of suffix trees and DAWGs, Discrete Applied Mathematics, vol.24, issue.1-3, pp.37-45, 1989.
DOI : 10.1016/0166-218X(92)90270-K

B. Clift, D. Haussler, R. Mcdonnell, T. D. Schneider, and G. D. Stormo, Sequence landscapes, Nucleic Acids Research, vol.14, issue.1, pp.141-158, 1986.
DOI : 10.1093/nar/14.1.141

M. Crochemore, Recherche lin eaire d'un carr e dans un mot, C. R. Acad. Sci. Paris S er. I Math, vol.296, pp.781-784, 1983.

M. Crochemore, Optimal factor tranducers, Combinatorial Algorithms on Words, pp.31-44, 1985.

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

M. Crochemore, Longest common factor of two words, TAPSOFT, number 249 in Lecture Notes in Computer Science, 1987.
DOI : 10.1007/3-540-17660-8_45
URL : https://hal.archives-ouvertes.fr/hal-00620786

M. Crochemore and C. Hancart, Pattern matching automata, Handbook of Formal Languages, 1997.
DOI : 10.1017/CBO9780511546853.003

M. Crochemore and W. Rytter, Text Algorithms, chapter 5-6, pages 73{130, 1994.

M. Farach, Optimal suux tree construction with large alphabets. manuscript, 1996.
DOI : 10.1109/sfcs.1997.646102
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.4336

R. W. Irving, Suux binary search trees, 1995.

J. Karkkainen, Suux cactus : a cross between suux tree and suux array, Combinatorial Pattern Matching, vol.937, pp.191-204, 1995.

C. Lefevre and J. Ikeda, The position end-set tree: A small automaton for word recognition in biological sequences, Bioinformatics, vol.9, issue.3, pp.343-348, 1993.
DOI : 10.1093/bioinformatics/9.3.343

U. Manber and G. Myers, Suffix Arrays: A New Method for On-Line String Searches, SIAM Journal on Computing, vol.22, issue.5, pp.935-948, 1993.
DOI : 10.1137/0222058

E. Mccreight, A Space-Economical Suffix Tree Construction Algorithm, Journal of the ACM, vol.23, issue.2, pp.262-272, 1976.
DOI : 10.1145/321941.321946

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

E. Ukkonen, On-line construction of suffix trees, Algorithmica, vol.10, issue.3, pp.249-260, 1995.
DOI : 10.1007/BF01206331

E. Ukkonen and D. Wood, Approximate string matching with suffix automata, Algorithmica, vol.21, issue.5, pp.353-364, 1993.
DOI : 10.1007/BF01769703

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