106 citations · 249 across the 101 of their papers we have counts for
Showing cs.DMShow 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.DM2014★ 106 cited
The "Runs" Theorem
Hideo Bannai, Tomohiro I, Shunsuke Inenaga +3
We give a new characterization of maximal repetitions (or runs) in strings based on Lyndon words. The characterization leads to a proof of what was known as the "runs" conjecture (…