Compressed Dictionary Matching on Run-Length Encoded Strings

Philip Bille, Inge Li Gørtz, Simon J. Puglisi +1

Given a set of pattern strings $\mathcal{P}=\{P_1,P_2,\dots P_k\}$ and a text string $S$, the classic dictionary matching problem is to report all occurrences of each pattern in…