Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CPM.2019.22
URN: urn:nbn:de:0030-drops-104930
URL: https://drops.dagstuhl.de/opus/volltexte/2019/10493/
Gawrychowski, Pawel ; Radoszewski, Jakub ; Starikovskaya, Tatiana
Quasi-Periodicity in Streams
| pdf-format: |
|
Abstract
In this work, we show two streaming algorithms for computing the length of the shortest cover of a string of length n. We start by showing a two-pass algorithm that uses O(log^2 n) space and then show a one-pass streaming algorithm that uses O(sqrt{n log n}) space. Both algorithms run in near-linear time. The algorithms are randomized and compute the answer incorrectly with probability inverse-polynomial in n. We also show that there is no sublinear-space streaming algorithm for computing the length of the shortest seed of a string.
BibTeX - Entry
@InProceedings{gawrychowski_et_al:LIPIcs:2019:10493,
author = {Pawel Gawrychowski and Jakub Radoszewski and Tatiana Starikovskaya},
title = {{Quasi-Periodicity in Streams}},
booktitle = {30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)},
pages = {22:1--22:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-103-0},
ISSN = {1868-8969},
year = {2019},
volume = {128},
editor = {Nadia Pisanti and Solon P. Pissis},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10493},
URN = {urn:nbn:de:0030-drops-104930},
doi = {10.4230/LIPIcs.CPM.2019.22},
annote = {Keywords: Streaming algorithms, quasi-periodicity, covers, seeds}
}
| Keywords: | Streaming algorithms, quasi-periodicity, covers, seeds | |
| Seminar: | 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019) | |
| Issue date: | 2019 | |
| Date of publication: | 06.06.2019 |
