保序模型中的字符串周期
String Periods in the Order-Preserving Model
摘要:
保序模型(op-model,简称op-model)是最近才被引入的,但由于其在数据分析中的应用,已经引起了人们的极大关注。我们在此设置中引入几种类型的时段(op-periods)。然后,我们给出算法来计算这些周期的时间$O(n)$,$O(n\log\log n)$,$O(n \log^2 \log n/\log \log \log n)$,$O(n\log n)$取决于类型的周期性。在最一般的变体中,不同周期的数量可以与$Ω(n^2)$一样大,并且需要紧凑的表示。我们的算法需要新的组合洞察到这些期间的属性。
英文摘要:
The order-preserving model (op-model, in short) was introduced quite recently but has already attracted significant attention because of its applications in data analysis. We introduce several types of periods in this setting (op-periods). Then we give algorithms to compute these periods in time $O(n)$, $O(n\log\log n)$, $O(n \log^2 \log n/\log \log \log n)$, $O(n\log n)$ depending on the type of periodicity. In the most general variant the number of different periods can be as big as $Ω(n^2)$, and a compact representation is needed. Our algorithms require novel combinatorial insight into the properties of such periods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。