Binary jumbled string matching for highly run-length compressible texts
We present a new index for binary jumbled pattern matching (Corner Index). It suffices to use full-run substrings to compute the Parikh set of any string. The algorithm is simple and practical. We express the Parikh set in terms of rle of the prefix normal forms.
jumbled pattern matching prefix normal form string algorithms data structures parikh vectors run-length encoding