Keisuké Goto

Linear Time Online Algorithms for Constructing Linear-size Suffix Trie

2023 · arXiv (Cornell University)

The suffix trees are fundamental data structures for various kinds of string processing. The suffix tree of a text string $T$ of length $n$ has $O(n)$ nodes and edges, and the string label of each …

Re-Pair In Small Space

2019 · arXiv (Cornell University)

Re-Pair is a grammar compression scheme with favorably good compression rates. The computation of Re-Pair comes with the cost of maintaining large frequency tables, which makes it hard to compute Re-Pair on large scale data …