Abstract: The notion of sequence itemset is introduced for algorithm to deal with permutations items or transactions of itemsets. A recursive method is provided to generate signatures with different length in turn. The algorithm utilizes offset attributor set to restrict and remove ineffective itemsets. According to selection principle, the optimal constrained frequency sequence itemset as signatures can be found. The result shows that the signatures extracted by this algorithm are reasonable and effective.