R. Agrawal and R. Srikant, Mining sequential patterns, Proc. 1995 Int. Conf. Data Engineering (ICDE'95), pp.3-14, 1995.

J. Ayres, J. Flannick, J. Gehrke, and T. Yiu, Sequential pattern mining using a bitmap representation, KDD, pp.429-435, 2002.

J. Boulicaut, A. Bykowski, and C. Rigotti, Free-sets: A condensed representation of boolean data for the approximation of frequency queries, Data Min. Knowl. Discov, vol.7, issue.1, pp.5-22, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01503814

T. Calders and B. Goethals, Mining all non-derivable frequent itemsets, PKDD, pp.74-85, 2002.

M. El, -. Hajj, and O. R. Zaïane, Finding all frequent patterns starting from the closure, ADMA, pp.67-74, 2005.

B. Ganter and R. Wille, Applied lattice theory: Formal concept analysis, 1997.

J. Han, OLAP mining: Integration of OLAP with data mining, IFIP Conference on Data Semantics, pp.1-11, 1997.

J. Han, J. Pei, and Y. Yin, Mining frequent patterns without candidate generation, SIGMOD Conference, pp.1-12, 2000.

F. Masseglia, F. Cathala, and P. Poncelet, The PSP Approach for Mining Sequential Patterns, Proc. of PKDD, volume 1510 of LNCS, pp.176-184, 1998.

N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Discovering frequent closed itemsets for association rules, ICDT, pp.398-416, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00467747

J. Pei, J. Han, B. Mortazavi-asl, J. Wang, H. Pinto et al.,

. Hsu, Mining sequential patterns by pattern-growth: The prefixspan approach, IEEE Transactions on Knowledge and Data Engineering, vol.16, issue.10, 2004.

J. Pei, Pattern-growth Methods for Frequent Pattern Mining, Canada, 2002.

J. Pei, J. Han, and R. Mao, Closet: An efficient algorithm for mining frequent closed itemsets, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp.21-30, 2000.

H. Pinto, J. Han, J. Pei, K. Wang, Q. Chen et al., Multidimensional sequential pattern mining, CIKM, pp.81-88, 2001.

M. Plantevit, Y. Wei-choong, A. Laurent, D. Laurent, and M. Teisseire, M 2 sp: Mining sequential patterns among several dimensions, PKDD, pp.205-216, 2005.
URL : https://hal.archives-ouvertes.fr/lirmm-00106087

C. Rassi and P. Poncelet, Deducing bounds on the support of sequential patterns, 2006.

P. Songram, V. Boonjing, and S. Intakosum, Closed multidimensional sequential pattern mining, ITNG, pp.512-517, 2006.

J. Wang, J. Han, and C. Li, Frequent closed sequence mining without candidate maintenance, IEEE Trans. Knowl. Data Eng, vol.19, issue.8, pp.1042-1056, 2007.

J. Wang, J. Han, and J. Pei, Closet+: searching for the best strategies for mining frequent closed itemsets, KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pp.236-245, 2003.

T. Sadok-ben-yahia, E. M. Hamrouni, and . Nguifo, Frequent closed itemset based algorithms: a thorough structural and analytical survey, SIGKDD Explorations, vol.8, issue.1, pp.93-104, 2006.

X. Yan, J. Han, and R. Afshar, Clospan: Mining closed sequential patterns in large databases, SDM, 2003.

C. Yu and Y. Chen, Mining sequential patterns from multidimensional sequence data, IEEE Transactions on Knowledge and Data Engineering, vol.17, issue.1, pp.136-140, 2005.

M. Zaki, Spade: An efficient algorithm for mining frequent sequences, Machine Learning, vol.42, pp.31-60, 2001.

J. Mohammed, C. Zaki, and . Hsiao, Charm: An efficient algorithm for closed itemset mining, SDM, 2002.