M. I. Abouelhoda and M. Ghanem, String Mining in Bioinformatics, Scientific Data Mining and Knowledge Discovery, pp.207-247, 2010.
DOI : 10.1007/978-3-642-02788-8_9

M. I. Abouelhoda, S. Kurtz, and E. Ohlebusch, Replacing suffix trees with enhanced suffix arrays, Journal of Discrete Algorithms, vol.2, issue.1, pp.53-86, 2004.
DOI : 10.1016/S1570-8667(03)00065-0
URL : http://doi.org/10.1016/s1570-8667(03)00065-0

A. Apostolico, M. Comin, and L. Parida, Bridging lossy and lossless compression by motif pattern discovery, General Theory of Information Transfer and Combinatorics, pp.793-813, 2006.
DOI : 10.1007/11889342_51
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.765

H. Arimura and T. Uno, An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence, Journal of Combinatorial Optimization, vol.8, issue.3, pp.243-262, 2007.
DOI : 10.1007/s10878-006-9029-1

B. S. Baker, On finding duplication and near-duplication in large software systems, Proceedings of 2nd Working Conference on Reverse Engineering, pp.86-95, 1995.
DOI : 10.1109/WCRE.1995.514697

S. Brin, J. Davis, and H. Garcia-molina, Copy detection mechanisms for digital documents, Proc. ACM SIGMOD, pp.398-409, 1995.
DOI : 10.1145/223784.223855
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.8485

C. Chang, C. Hsu, and S. Lui, Automatic information extraction from semistructured web pages by pattern discovery, Decis Support Syst, vol.34, issue.1, pp.129-147, 2003.
DOI : 10.1016/s0167-9236(02)00100-8

X. Chen, B. Francia, M. Li, B. Mckinnon, and A. Seker, Shared Information and Program Plagiarism Detection, IEEE Transactions on Information Theory, vol.50, issue.7, pp.1545-1551, 2004.
DOI : 10.1109/TIT.2004.830793
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.76

H. Debar, M. Dacier, and A. Wespi, Towards a taxonomy of intrusion-detection systems, Computer Networks, vol.31, issue.8, pp.31805-822, 1999.
DOI : 10.1016/S1389-1286(98)00017-6

M. Federico and N. Pisanti, Suffix tree characterization of maximal motifs in biological sequences, Theoretical Computer Science, vol.410, issue.43, pp.4391-4401, 2009.
DOI : 10.1016/j.tcs.2009.07.020

R. Grossi, A. Pietracaprina, N. Pisanti, G. Pucci, E. Upfal et al., MADMX: A Strategy for Maximal Dense Motif Extraction, Journal of Computational Biology, vol.18, issue.4, pp.535-545, 2011.
DOI : 10.1089/cmb.2010.0177

D. Harel and R. Tarjan, Fast Algorithms for Finding Nearest Common Ancestors, SIAM Journal on Computing, vol.13, issue.2, pp.338-355, 1984.
DOI : 10.1137/0213024

N. R. Mabroukeh and C. I. Ezeife, A taxonomy of sequential pattern mining algorithms, ACM Computing Surveys, vol.43, issue.1, p.3, 2010.
DOI : 10.1145/1824795.1824798

E. M. 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

L. Parida, I. Rigoutsos, A. Floratos, D. E. Platt, and Y. Gao, Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm, Proc. 11th SODA, pp.297-308, 2000.

L. Parida, I. Rigoutsos, and D. E. Platt, An Output-Sensitive Flexible Pattern Discovery Algorithm, Proc. 12th CPM, pp.131-142, 2001.
DOI : 10.1007/3-540-48194-X_11

L. Pichl, T. Yamano, and T. Kaizoji, On the Symbolic Analysis of Market Indicators with the Dynamic Programming Approach, Proc. ISNN, pp.432-441, 2006.
DOI : 10.1007/11760191_64

I. Rigoutsos and T. Huynh, Chung-Kwei: a Pattern-discovery-based System for the Automatic Identification of Unsolicited E-mail Messages, CEAS, 2004.

M. Sagot, Spelling approximate repeated or common motifs using a suffix tree, Proc. 3rd LATIN, pp.374-390, 1998.
DOI : 10.1007/BFb0054337
URL : https://hal.archives-ouvertes.fr/hal-00428511

R. Sherkat and D. Rafiei, Efficiently Evaluating Order Preserving Similarity Queries over Historical Market-Basket Data, 22nd International Conference on Data Engineering (ICDE'06), pp.19-19, 2006.
DOI : 10.1109/ICDE.2006.59

E. Ukkonen, Maximal and minimal representations of gapped and non-gapped motifs of a string, Theoretical Computer Science, vol.410, issue.43, pp.4341-4349, 2009.
DOI : 10.1016/j.tcs.2009.07.015