Compressed Data Structures for Dynamic Sequences

J. Ian Munro, Yakov Nekrich

We consider the problem of storing a dynamic string $S$ over an alphabet $\Sigma =\{1,\dots ,\sigma \}$ in compressed form. Our representation supports insertions and deletions of symbols…