A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. T. Chen et al., SubtiList 3. from ftp://ftp.mips.embnet.org/pub The smallest automaton recognizing the subwords of a text, Theoret. Comput. Sci, pp.40-71, 1985.

C. , M. And-rytter, and W. , Text Algorithms, 1994.

C. , M. And-v-´-erin, and R. , On compact directed acyclic word graphs, LNCS, vol.1261, pp.192-211, 1997.

K. , D. E. , M. Jr, J. H. And-pratt, and V. R. , Fast pattern matching in strings, SIAM J. Comput, vol.6, pp.323-350, 1977.

K. , R. And-kucherov, and G. , Finding maximal repetitions in a word in linear time, Proceedings of the 1999 Symposium on Foundations of Computer Science, pp.596-604, 1999.

K. , R. And-kucherov, and G. , On maximal repetitions in words, Proceedings of the 12- th International Symposium on Fundamentals of Computation Theory, pp.374-385, 1999.

L. , G. M. And-schmidt, and J. P. , An algorithm for approximate tandem repeats, LNCS, vol.684, pp.120-132, 1993.

M. G. Main, Detecting leftmost maximal periodicities, Discrete Applied Mathematics, vol.25, issue.1-2, pp.145-153, 1989.
DOI : 10.1016/0166-218X(89)90051-6
URL : http://doi.org/10.1016/0166-218x(89)90051-6

M. G. Main, R. J. And-lorentz, and ¢. ¡. An, An O(n log n) algorithm for finding all repetitions in a string, Journal of Algorithms, vol.5, issue.3, pp.422-432, 1984.
DOI : 10.1016/0196-6774(84)90021-X

R. , M. Pratt, V. R. And-even, and S. , Linear algorithm for data compression via string matching, Journal of the ACM, vol.28, issue.1, pp.16-24, 1981.

S. , M. And-myers, and E. W. , Identifying satellites in nucleic acid sequences, pp.234-242, 1999.