1. Coquery, E., Jabbour, S., Sais, L., Salhi, Y.: A SAT-Based Approach for discovering frequent, closed and maximal pattern in a sequence. In: 20th European Conference on Artificial Intelligence ECAI, pp 258–263 (2012)
2. Rajeb, A., Hamdou, A.B., Loukil, Z.: On the enumeration of frequent patterns in sequences. In: The International Conference on Artificial Intelligence and Pattern Recognition (AIPR’2014), pp 40–344 (2014)
3. Rajeb, A., Hamdou, A.B., Loukil, Z.: A CSP for the enumeration of frequent-closed patterns in sequences. In: The International Conference on Artificial Intelligence and Pattern Recognition (AIPR’2015), pp 59–63 (2015)
4. Parida, L., Rigoutsos, I., Floratos, A., Platt, D.: An out put-sensitive flexible pattern discovery algorithm. In: Proceeding of the 12th Annual Symposium on Combinatorial Pattern Maching (CPM’2001), Lecture Notes in computer Science, vol. 2089, pp 131–142. Springer (2001)
5. Pisanti, N., Crochemore, M., Grossi, R., Sagot, M.-F.: A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum. In: Proceedings MFCS’03, LNCS 2747, pp 622–631 (2003)