Takuya Mieno

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 …

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 …