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 on simulated and on real-world datasets, and found that the second algorithm outperforms the first algorithm on all simulated data, while on the real-world data, the performance varies between a slight slowdown (on half of the datasets) and a speedup by a factor of up to 11.