Ayumi Shinohara

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 …

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 …

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, …