Binary Jumbled String Matching for Highly Run-Length Compressible Texts

Golnaz Badkobeh, Gabriele Fici, Steve Kroon +1

The Binary Jumbled String Matching problem is defined as: Given a string $s$ over $\{a,b\}$ of length $n$ and a query $(x,y)$, with $x,y$ non-negative integers, decide whether $s$…