arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1609.07220cs.DM
收藏

最短唯一子串最大个数的紧界

Tight bounds on the maximum number of shortest unique substrings

Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

摘要:

一个字符串S的子串Q被称为S中区间[s,t]的最短唯一子串(SUS),如果Q在S中只出现一次,Q的出现包含区间[s,t],并且S的每个包含区间[s,t]且短于Q的子串在S中至少出现两次。SUS问题是,给定一个字符串S,对S进行预处理,以便对于任何后续查询间隔[s,t],可以快速回答间隔[s,t]的所有SUS。当s = t时,我们将[s,t]的SUs称为点SUs,当s \leq t时,我们将[s,t]的SUs称为区间SUs。存在最优的O(n)时间预处理方案,其在最优的O(k)时间内回答点和区间SUS的查询,其中n是S的长度,k是给定查询的输出数量。在本文中,我们揭示了结构,组合性质的SUS问题的基础:即,我们表明,在S中对应于点SUS在S中的所有查询位置的间隔的数量小于1.5n,并表明这是一个匹配的上限和下限。此外,我们考虑S中对应于S中所有查询区间的区间SUS的最大区间数。

英文摘要:

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 every substring of S which contains interval [s,t] and is shorter than Q occurs at least twice in S. The SUS problem is, given a string S, to preprocess S so that for any subsequent query interval [s,t] all the SUSs for interval [s,t] can be answered quickly. When s = t, we call the SUSs for [s,t] as point SUSs, and when s \leq t, we call the SUSs for [s,t] as interval SUSs. There exist optimal O(n)-time preprocessing scheme which answers queries in optimal O(k) time for both point and interval SUSs, where n is the length of S and k is the number of outputs for a given query. In this paper, we reveal structural, combinatorial properties underlying the SUS problem: Namely, we show that the number of intervals in S that correspond to point SUSs for all query positions in S is less than 1.5n, and show that this is a matching upper and lower bound. Also, we consider the maximum number of intervals in S that correspond to interval SUSs for all query intervals in S.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑