Masayuki Takeda

Tight Bounds on the Maximum Number of Shortest Unique Substrings

2017 · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

A substring Q of a string S is called a shortest unique substring (SUS) for interval [s,t] in S, if Q occurs exactly once in S, this occurrence of Q contains interval [s,t], and every …

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 …