Before revision:  We show that  the number of interesting patterns is upper-bounded by O(n^2)  where n is the length of the string.
After revision:  We show that , in our setting, the number of interesting patterns is upper-bounded by O(n^2) where n is the length of the string.