The application of the SPADE algorithm with the minimal support set to the 1% of the lexicon size resulted in roughly 27 thousand frequent subsequences.
our filtering technique based on the phi coefficient limited the set of patterns to 13 441 regular expressions.