Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2017.42
URN: urn:nbn:de:0030-drops-75911
URL: https://drops.dagstuhl.de/opus/volltexte/2017/7591/
Ergün, Funda ; Grigorescu, Elena ; Sadeqi Azer, Erfan ; Zhou, Samson
Streaming Periodicity with Mismatches
| pdf-format: |
|
Abstract
We study the problem of finding all k-periods of a length-n string S, presented as a data stream. S is said to have k-period p if its prefix of length n-p differs from its suffix of length n-p in at most k locations.We give a one-pass streaming algorithm that computes the k-periods of a string S using poly(k, log n) bits of space, for k-periods of length at most n/2. We also present a two-pass streaming algorithm that computes k-periods of S using poly(k, log n) bits of space, regardless of period length. We complement these results with comparable lower bounds.
BibTeX - Entry
@InProceedings{ergn_et_al:LIPIcs:2017:7591,
author = {Funda Erg{\"u}n and Elena Grigorescu and Erfan Sadeqi Azer and Samson Zhou},
title = {{Streaming Periodicity with Mismatches}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)},
pages = {42:1--42:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-044-6},
ISSN = {1868-8969},
year = {2017},
volume = {81},
editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and David Williamson and Santosh S. Vempala},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7591},
URN = {urn:nbn:de:0030-drops-75911},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2017.42},
annote = {Keywords: String algorithms, Streaming algorithms, Pattern matching, Randomized algorithms, Sublinear algorithms}
}
| Keywords: | String algorithms, Streaming algorithms, Pattern matching, Randomized algorithms, Sublinear algorithms | |
| Seminar: | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 11.08.2017 |
