Yuto Nakashima

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 …

Subsequence Matching and LCS under Cartesian-Tree Equivalence

2024 · arXiv (Cornell University)

Two strings of the same length are said to Cartesian-tree match (CT-match) if their Cartesian-trees are isomorphic [Park et al., TCS 2020]. Cartesian-tree matching is a natural model that allows for capturing similarities of numerical …