Before revision:  We introduce a baseline algorithm with \mathcal{O}(n^2) running time which identifies all interesting patterns for all colors in the string satisfying certain minimality conditions.
After revision:  We introduce a baseline algorithm , running in \mathcal{O}(n^2) running time which identifies all interesting patterns for all colors in the string satisfying certain minimality conditions.