The definition of antipower introduced by Fici et al. (ICALP 2016) captures the notion of being the opposite of a power: a sequence of k pairwise distinct blocks of the same length. Recently, Alamro et al. (CPM 2019) defined a string to have an antiperiod if it is a prefix of an antipower, and gave complexity bounds for the offline computation of the minimum antiperiod and all the antiperiods of a word. In this paper, we address the same problems in the online setting. Our solutions rely on new arrays that compactly and incrementally store antiperiods and antipowers as the word grows, obtaining in the process this information for all the word’s prefixes. We show how to compute those arrays online in O(n log n) space, O(n log n) time, and o(n^epsilon) delay per character, for any constant epsilon > 0. Running times are worst-case and hold with high probability. We also discuss more space-efficient solutions returning the correct result with high probability, and small data structures to support random access to those arrays.
|Data di pubblicazione:||2019|
|Titolo:||Online Algorithms on Antipowers and Antiperiods|
|Titolo del libro:||String Processing and Information Retrieval: 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7–9, 2019, Proceedings|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1007/978-3-030-32686-9_13|
|Appare nelle tipologie:||4.1 Articolo in Atti di convegno|
File in questo prodotto: