Binary Jumbled Indexing: Suffix tree histogram

Luís Cunha, Mário Medina

Given a binary string $\ddot{I}‰$ over the alphabet $\{0,1\}$, a vector $(a,b)$ is a Parikh vector if and only if a factor of $\ddot{I}‰$ contains exactly $a$ occurrences of $0$ and $b$ occurr…