eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2018-02-27
38:1
38:16
10.4230/LIPIcs.STACS.2018.38
article
String Periods in the Order-Preserving Model
Gourdel, Garance
Kociumaka, Tomasz
Radoszewski, Jakub
Rytter, Wojciech
Shur, Arseny
Walen, Tomasz
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 Omega(n^2), and a compact representation is needed. Our algorithms require novel combinatorial insight into the properties of such periods.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol096-stacs2018/LIPIcs.STACS.2018.38/LIPIcs.STACS.2018.38.pdf
order-preserving pattern matching
period
efficient algorithm