Mitsuru Funakoshi

Detecting $k$-(Sub-)Cadences and Equidistant Subsequence Occurrences

2020 · arXiv (Cornell University)

The equidistant subsequence pattern matching problem is considered. Given a pattern string $P$ and a text string $T$, we say that $P$ is an \emph{equidistant subsequence} of $T$ if $P$ is a subsequence 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 …