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. When one is interested in patterns related to only one color , we provide an algorithm that identifies patterns in \mathcal{O}(n^2\log n) time , but is faster than the first algorithm in practice , both on simulated and on real-world patterns.
After revision:  We introduce a baseline algorithm with \mathcal{O}(n^2) running time which identifies all interesting patterns for all colors in the string . For the case where one is interested in patterns related to only one color , we provide an algorithm that identifies patterns in \mathcal{O}(n^2\log n) time , but is faster than the first algorithm in practice , both on simulated and on real-world patterns.