Online Algorithms on Antipowers and Antiperiods

Abstract

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) delay per character, for any constant > 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.

Faster Online Computation of the Succinct Longest Previous Factor Array

“…Future extensions of this work will include reducing the delay of our algorithm (currently O(n log n)). We observe that it is rather simple to obtain O(log 2 n) delay at the cost of randomizing the algorithm by employing an online Karp-Rabin fingerprinting structure such as the one described in [2]: once fast fingerprinting is available, one can quickly find the LCS between any two text prefixes by binary search. It would also be interesting to reduce the overall running time of our algorithm.…”

Finding the Cyclic Covers of a String

“…Li and Smyth [24] produced an on-line algorithm for the all-covers problem. Related string factorization problems include antiperiods [2] and anticovers [1], in addition to approximate [3] and partial [22] covers and seeds [21]. Other combinatorial covering problems consider applications to graphs [31,11].…”