具有通配符的数据流的周期性
Periodicity in Data Streams with Wildcards
摘要:
我们调查的问题,检测周期性的趋势,在一个字符串$S$的长度$n$,到达流模型,包含最多的$k$通配字符,其中$k=o(n)$。字符串是一种特殊的字符,可以被分配给任何其他字符。如果存在对每个通配字符的赋值,则我们说$S$具有通配符-句点$p$,使得在结果流中长度$n-p$前缀等于长度$n-p$后缀。我们提出了一个两遍流算法,计算通配符周期的$S$使用$\mathcal{O}(k^3\,\mathsf{polylog}\,n)$位的空间,而我们也表明,这个问题不能在次线性空间中解决一遍。然后,我们给出了一个一次通过的随机流算法,计算所有的通配符周期PDMATHBMQ的$S$与$p<\frac{n}{2}$和没有出现在最后的$p$符号的$S$,使用$\mathcal{O}(k^3\mathsf{polylog}\, n)$空间。
英文摘要:
We investigate the problem of detecting periodic trends within a string $S$ of length $n$, arriving in the streaming model, containing at most $k$ wildcard characters, where $k=o(n)$. A wildcard character is a special character that can be assigned any other character. We say $S$ has wildcard-period $p$ if there exists an assignment to each of the wildcard characters so that in the resulting stream the length $n-p$ prefix equals the length $n-p$ suffix. We present a two-pass streaming algorithm that computes wildcard-periods of $S$ using $\mathcal{O}(k^3\,\mathsf{polylog}\,n)$ bits of space, while we also show that this problem cannot be solved in sublinear space in one pass. We then give a one-pass randomized streaming algorithm that computes all wildcard-periods $p$ of $S$ with $p<\frac{n}{2}$ and no wildcard characters appearing in the last $p$ symbols of $S$, using $\mathcal{O}(k^3\mathsf{polylog}\, n)$ space.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。