F. Bonchi, F. Giannotti, A. Mazzanti, and D. Pedreschi, ExAnte: Anticipated Data Reduction in Constrained Pattern Mining, PKDD, 2003.
DOI : 10.1007/978-3-540-39804-2_8
URL : http://it.geocities.com/alessio_mazzanti/Articoli/ExAntePKDD03.pdf

G. Dong and J. Pei, Sequence Data Mining, of Advances in Database Systems. Kluwer, 2007.

P. Fournier-viger, A. Gomariz, M. Campos, and R. Thomas, Fast Vertical Mining of Sequential Patterns Using Co-occurrence Information, PAKDD, 2014.
DOI : 10.1007/978-3-319-06608-0_4

M. N. Garofalakis, R. Rastogi, and K. Shim, SPIRIT: sequential pattern mining with regular expression constraints, Proceedings VLDB'99, 1999.
DOI : 10.1109/tkde.2002.1000341
URL : http://www.cs.berkeley.edu/~minos/Papers/tkde02.ps.gz

A. Gomariz, M. Campos, R. Marín, and B. Goethals, ClaSP: An Efficient Algorithm for Mining Frequent Closed Sequences, PAKDD, 2013.
DOI : 10.1007/978-3-642-37453-1_5
URL : http://www.philippe-fournier-viger.com/spmf/clasp.pdf

J. Han, J. Pei, and Y. Yin, Mining frequent patterns without candidate generation, ACM SIGMOD Record, vol.29, issue.2, pp.1-12, 2000.
DOI : 10.1145/335191.335372
URL : http://www.cs.uiuc.edu/~hanj/pdf/dami04_fptree.pdf

C. Li and J. Wang, Efficiently Mining Closed Subsequences with Gap Constraints, SDM, 2008.
DOI : 10.1137/1.9781611972788.28
URL : http://www.siam.org/proceedings/datamining/2008/dm08_28-Li.pdf

M. Lin, S. Hsueh, and C. Chang, Mining closed sequential patterns with time constraints, J. Inf. Sci. Eng, vol.24, issue.1, pp.33-46, 2008.

M. Nanni and C. Rigotti, Extracting Trees of Quantitative Serial Episodes, Proc. of KDID, 2007.
DOI : 10.1007/978-3-540-75549-4_11
URL : https://hal.archives-ouvertes.fr/hal-01613806

J. Pei, J. Han, and W. Wang, Constraint-based sequential pattern mining: the pattern-growth methods, Journal of Intelligent Information Systems, vol.42, issue.1-2, pp.133-160, 2007.
DOI : 10.1007/s10844-006-0006-z

M. Plantevit and B. Crémilleux, Condensed Representation of Sequential Patterns According to Frequency-Based Measures, IDA, 2009.
DOI : 10.1137/1.9781611972788.59
URL : https://hal.archives-ouvertes.fr/hal-01011587

H. Schmid, Probabilistic part-of-speech tagging using decision trees, Proc. of the Int. Conf. on New Methods in Language Processing, 1994.

R. Srikant and R. Agrawal, Mining sequential patterns: Generalizations and performance improvements, EDBT, pp.3-17, 1996.
DOI : 10.1007/BFb0014140
URL : http://arbor.ee.ntu.edu.tw/~chyun/dmpaper/srikms96.pdf

J. Wang and J. Han, BIDE: efficient mining of frequent closed sequences, Proceedings. 20th International Conference on Data Engineering, 2004.
DOI : 10.1109/ICDE.2004.1319986
URL : http://www.cs.uiuc.edu/~hanj/pdf/icde04_bide.pdf

J. Wang, J. Han, and C. Li, Frequent Closed Sequence Mining without Candidate Maintenance, IEEE Transactions on Knowledge and Data Engineering, vol.19, issue.8, pp.1042-1056, 2007.
DOI : 10.1109/TKDE.2007.1043

X. Yan, J. Han, and R. Afshar, CloSpan: Mining: Closed Sequential Patterns in Large Datasets, SDM, 2003.
DOI : 10.1137/1.9781611972733.15
URL : http://www-faculty.cs.uiuc.edu/~hanj/pdf/sdm03_clospan.pdf

M. J. Zaki, Sequence mining in categorical domains, Proceedings of the ninth international conference on Information and knowledge management , CIKM '00, 2000.
DOI : 10.1145/354756.354849

M. J. Zaki, SPADE: An efficient algorithm for mining frequent sequences, Machine Learning, vol.42, issue.1/2, pp.31-60, 2001.
DOI : 10.1023/A:1007652502315