2 citations · 6 across the 31 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DS2025
On the number of MUSs crossing a position
Hiroto Fujimaru, Takuya Mieno, Shunsuke Inenaga
A string is said to be a minimal unique substring (MUS) of a string if occurs exactly once in , and any proper substring of occurs at least twice in . It is k…
cs.DS2025
Almost succinct representation of maximal palindromes
Takuya Mieno, Tomohiro I, Valerio Stancanelli
Palindromes are strings that read the same forward and backward. The computation of palindromic structures within strings is a fundamental problem in string algorithms, being motiv…