License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2018.38
URN: urn:nbn:de:0030-drops-85064
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8506/
Go to the corresponding LIPIcs Volume Portal

Gourdel, Garance ; Kociumaka, Tomasz ; Radoszewski, Jakub ; Rytter, Wojciech ; Shur, Arseny ; Walen, Tomasz

String Periods in the Order-Preserving Model

pdf-format:
LIPIcs-STACS-2018-38.pdf (0.6 MB)

Abstract

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.

BibTeX - Entry

@InProceedings{gourdel_et_al:LIPIcs:2018:8506,
  author =	{Garance Gourdel and Tomasz Kociumaka and Jakub Radoszewski and Wojciech Rytter and Arseny Shur and Tomasz Walen},
  title =	{{String Periods in the Order-Preserving Model}},
  booktitle =	{35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
  pages =	{38:1--38:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-062-0},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{96},
  editor =	{Rolf Niedermeier and Brigitte Vall{\'e}e},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8506},
  URN =		{urn:nbn:de:0030-drops-85064},
  doi =		{10.4230/LIPIcs.STACS.2018.38},
  annote =	{Keywords: order-preserving pattern matching, period, efficient algorithm}
}

Keywords: order-preserving pattern matching, period, efficient algorithm
Collection: 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)
Issue Date: 2018
Date of publication: 27.02.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI