106 citations · 138 across the 47 of their papers we have counts for
4 papers · 1 filter
On the compressiveness of the Burrows-Wheeler transform
Hideo Bannai, Tomohiro I, Yuto Nakashima
The Burrows-Wheeler transform (BWT) is a reversible transform that converts a string into another string . The size of the run-length encoded BWT (RLBWT) can b…
Tight bounds on the number of non-equivalent parameterized squares in a word
Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima +3
Two words of the same length are said to be \emph{parameterized equivalent} if there exists a character bijection that transforms into . A word is called a paramet…
Edit and Alphabet-Ordering Sensitivity of Lex-parse
Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi +2
We investigate the compression sensitivity [Akagi et al., 2023] of lex-parse [Navarro et al., 2021] for two operations: (1) single character edit and (2) modification of the alphab…
Subsequence Matching and LCS under Cartesian-Tree Equivalence
Taketo Tsujimoto, Yuki Yonemoto, Hiroki Shibata +3
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 mod…