Before revision:  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:  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 solutions use suffix trees, and the second algorithm also uses an appropriately defined priority queue, which allows us to reduce the number of computations. We performed an experimental evaluation of the proposed approaches over both synthetic and real-world patterns.