Local Maximal Equality-Free Periodicities

In this paper, we study local maximal antiperiodicities. Given a string X and an integer k, we compute the maximal k-antiperiodicity starting at every position of X; that is, we identify a maximum-length sequence of distinct factors, where each is of length k. The space and time complexity of the algorithm is linear.