Finding pattern matchings for permutations
Information Processing Letters
Pattern matching for permutations
Information Processing Letters
Necklaces, convolutions, and X + Y
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Sub-quadratic time and linear space data structures for permutation matching in binary strings
Journal of Discrete Algorithms
A note on efficient computation of all Abelian periods in a string
Information Processing Letters
New algorithms for binary jumbled pattern matching
Information Processing Letters
Binary jumbled string matching for highly run-length compressible texts
Information Processing Letters
Algorithms for computing Abelian periods of words
Discrete Applied Mathematics
| Hi-index | 0.89 |
Given a pattern P of length m and a text T of length n, the permutation matching problem asks whether any permutation of P occurs in T. Indexing a string for permutation matching seems to be quite hard in spite of the existence of a simple non-indexed solution. It is an open question whether there exists an index data structure for this problem with o(n^2) time and space complexity even for a binary alphabet. In this paper, we settle this question by reducing the problem to the (min,+) convolution problem and thereby achieving an O(n^2/logn) time data structure for a binary string capable of answering permutation queries in O(m) time. The space requirement of the data structure is also improved to be linear.