ACM Computing Surveys (CSUR)
Indexing permutations for binary strings
Information Processing Letters
On table arrangements, scrabble freaks, and jumbled pattern matching
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Sub-quadratic time and linear space data structures for permutation matching in binary strings
Journal of Discrete Algorithms
On Approximate Jumbled Pattern Matching in Strings
Theory of Computing Systems - Special Issue: Fun with Algorithms
New algorithms for binary jumbled pattern matching
Information Processing Letters
Binary jumbled string matching for highly run-length compressible texts
Information Processing Letters
| Hi-index | 0.04 |
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 (2006) 167-170] introduced the notion of an Abelian period of a word. A word of length n over an alphabet of size @s can have @Q(n^2) distinct Abelian periods. The Brute-Force algorithm computes all the Abelian periods of a word in time O(n^2x@s) using O(nx@s) space. We present an offline algorithm based on a select function having the same worst-case theoretical complexity as the Brute-Force one, but outperforming it in practice. We then present online algorithms that also enable us to compute all the Abelian periods of all the prefixes of w.