We introduce efficient data structures for an indexing problem in non-standard stringology—
jumbled pattern matching. Moosa and Rahman J. Discr. Alg., 2012 gave an index for …

The aim of this survey is to provide insight into the sequential algorithms that have been
proposed to compute exact “regularities” in strings; that is, covers (or quasiperiods), seeds …

We derive a simple efficient algorithm for Abelian periods knowing all Abelian squares in a
string. An efficient algorithm for the latter problem was given by Cummings and Smyth in …

In this paper we investigate jumbled (Abelian) versions of three classical strings problems. In
all these problems we assume the input string S [1.. n] is given in its run-length format S′[1 …

We present efficient algorithms computing all Abelian periods of two types in a word.
Regular Abelian periods are computed in O (n log log {n}) randomized time which improves …

We propose the first subquadratic-time algorithms to a number of natural problems in
abelian pattern matching (also called jumbled pattern matching) for strings over a constant …

Recently, Constantinescu and Ilie proved a variant of the well-known periodicity theorem of
Fine and Wilf in the case of two relatively prime abelian periods and conjectured a result for …

In this article we study the appearance of abelian borders in binary words, a notion closely
related to the abelian period of a word. We show how many binary words have shortest …

Abstract Constantinescu and Ilie [S. Constantinescu, L. Ilie. Fine and Wilf's theorem for
abelian periods, Bulletin of the European Association for Theoretical Computer Science 89 …

We investigate Abelian primitive words, which are words that are not Abelian powers. We
show the set of Abelian primitive words is not context-free. We can determine whether a …