2 citations · 6 across the 31 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DM2016★ 2 cited
Tight bounds on the maximum number of shortest unique substrings
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai +1
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 ev…
cs.DS2016
Shortest unique palindromic substring queries in optimal time
Yuto Nakashima, Hiroe Inoue, Takuya Mieno +3
A palindrome is a string that reads the same forward and backward. A palindromic substring of a string is called a shortest unique palindromic substring () f…