A comparison of approximate string matching algorithms
Software—Practice & Experience
Finding pattern matchings for permutations
Information Processing Letters
Pattern matching for permutations
Information Processing Letters
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
DLT'11 Proceedings of the 15th international conference on Developments in language theory
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
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.00 |
Given a pattern P of length n and a text T of length m, 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. In this paper, we devise several o(n^2) time data structures for a binary string capable of answering permutation queries in O(m) time. In particular, we first present two O(n^2/logn) time data structures and then improve the data structure construction time to O(n^2/log^2n). The space complexity of the data structures remains linear.