Algorithms for anti-powers in strings
Abstract A string S [1, n] is a power (or tandem repeat) of order k and period n/k if it can be
decomposed into k consecutive equal-length blocks of letters. Powers and periods are
fundamental to string processing, and algorithms for their efficient computation have wide
application and are heavily studied. Recently, Fici et al.(Proc. ICALP 2016) defined an anti-
power of order k to be a string composed of k pairwise-distinct blocks of the same length
(n/k, called anti-period). Anti-powers are a natural converse to powers, and are objects of …
decomposed into k consecutive equal-length blocks of letters. Powers and periods are
fundamental to string processing, and algorithms for their efficient computation have wide
application and are heavily studied. Recently, Fici et al.(Proc. ICALP 2016) defined an anti-
power of order k to be a string composed of k pairwise-distinct blocks of the same length
(n/k, called anti-period). Anti-powers are a natural converse to powers, and are objects of …
以上显示的是最相近的搜索结果。 查看全部搜索结果