Chapter
Local Maximal Equality-Free Periodicities
Abstract
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.
Authors
Alzamel M; Daykin JW; Hampson C; Iliopoulos CS; Lim Z; Smyth WF
Book title
Artificial Intelligence Applications and Innovations. AIAI 2023 IFIP WG 12.5 International Workshops
Series
IFIP Advances in Information and Communication Technology
Volume
677
Pagination
pp. 359-368
Publisher
Springer Nature
Publication Date
2023
DOI
10.1007/978-3-031-34171-7_29