Inge Li Gørtz

Practical and Effective Re-Pair Compression

2017 · arXiv (Cornell University)

Re-Pair is an efficient grammar compressor that operates by recursively replacing high-frequency character pairs with new grammar symbols. The most space-efficient linear-time algorithm computing Re-Pair uses $(1+ε)n+\sqrt n$ words on top of the re-writable text …

Sliding Window String Indexing in Streams

2023 · arXiv (Cornell University)

Given a string $S$ over an alphabet $Σ$, the 'string indexing problem' is to preprocess $S$ to subsequently support efficient pattern matching queries, i.e., given a pattern string $P$ report all the occurrences of $P$ …