Comparison between SAT-based and CSP-based approaches to resolve pattern mining problems

Abstract

The pattern mining in sequences is an important research field, especially in computational biology and text mining. Many approaches are proposed to resolve this problem. The declarative approach is one of them and consists to transform the pattern mining problem into another NP-Complete problem like SAT and CSP. In this paper, we try to compare several techniques of pattern mining problems resolution after transforming them into SAT and CSP problems.