eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2019-06-06
22:1
22:14
10.4230/LIPIcs.CPM.2019.22
article
Quasi-Periodicity in Streams
Gawrychowski, Paweł
1
Radoszewski, Jakub
2
Starikovskaya, Tatiana
3
University of Wrocław, 50-137 Wrocław, Poland
Institute of Informatics, University of Warsaw, 02-097 Warsaw, Poland
DIENS, École normale supérieure, PSL Research University, 75005 Paris, France
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.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol128-cpm2019/LIPIcs.CPM.2019.22/LIPIcs.CPM.2019.22.pdf
Streaming algorithms
quasi-periodicity
covers
seeds