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…