Diptarama Hendrian

Inferring Strings from Position Heaps in Linear Time

2022 · arXiv (Cornell University)

Position heaps are index structures of text strings used for the string matching problem. They are rooted trees whose edges and nodes are labeled and numbered, respectively. This paper is concerned with variants of the …

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 …

Efficient Parameterized Pattern Matching in Sublinear Space

2023 · arXiv (Cornell University)

The parameterized matching problem is a variant of string matching, which is to search for all parameterized occurrences of a pattern $P$ in a text $T$. In considering matching algorithms, the combinatorial natures of strings, …