Abstract
The Simple Motif Problem (SMP) is: given a set of strings Y = {y(0), y(1), . . . , y(n-1)} built from a finite alphabet Sigma, p > 0 an integer and q <= n a quorum, find all the simple motifs of length at most p that occurs in at least q strings of Y.
This paper presents an experimental evaluation of algorithms dealing with SMP and using a minimal forbidden pattern approach. The experiments are concerned both with running times and space consumption.