Given a string T of length n, a substring $u=T[i..j]$ of T is called a shortest unique substring (SUS) for an interval $[s,t]$ if (a) u occurs exactly once in T, (b) u contains the interval $[s,t]$ (i.e. $i\le s\le t\le j$), and (c) every substring v of T with $|v|<|u|$ containing $[s,t]$ occurs at least twice in T. Given a query interval $[s,t]\subset [1,n]$, the interval SUS problem is to output all the SUSs for the interval $[s,t]$. In this article, we propose a $4n+o(n)$ bits data structure answering an interval SUS query in output-sensitive $O(occ)$ time, where occ is the number of returned SUSs. Additionally, we focus on the point SUS problem, which is the interval SUS problem for $s=t$. Here, we propose a $\lceil ({\log }_{2}3+1)n\rceil +o(n)$ bits data structure answering a point SUS query in the same output-sensitive time. We also propose space-efficient algorithms for computing the minimal unique substrings of T.

给定一个长度为n的字符串T，一个子字符串$ü=Ť[\mathrm{一世}。。Ĵ]$的T称为一定时间间隔内的最短唯一子串（SUS）$[s，Ť]$如果（a）Ü发生正好一次在Ť，（B）Ü包含间隔$[s，Ť]$ （即 $\mathrm{一世}\le s\le Ť\le Ĵ$），以及（c）每子串v的Ť与$|v|<|ü|$ 包含 $[s，Ť]$在T中至少发生两次。给定查询间隔$[s，Ť]\subset [\mathrm{1个}，ñ]$，间隔SUS问题是输出该间隔的所有SUS$[s，Ť]$。在本文中，我们建议$4ñ+Ø（ñ）$ 位数据结构在对输出敏感的情况下回答间隔SUS查询 $Ø（ØCC）$时间，其中OCC是返回SUSS的数量。另外，我们集中于点SUS问题，这是间隔SUS问题$s=Ť$。在这里，我们建议$\lceil （{\mathrm{日志}}_{2}3+\mathrm{1个}）ñ\rceil +Ø（ñ）$位数据结构在相同的输出敏感时间内回答一个点SUS查询。我们还提出了计算节省空间的算法最小的独特子的牛逼。