A new approach to text searching
Communications of the ACM
Efficient special cases of Pattern Matching with Swaps
Information Processing Letters
Journal of Algorithms
Information Processing Letters
Information and Computation
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A new model to solve the swap matching problem and efficient algorithms for short patterns
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Parallel pattern matching with swaps on a linear array
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
On a compact encoding of the swap automaton
Information Processing Letters
| Hi-index | 0.00 |
The Pattern Matching problem with Swaps consists in finding all occurrences of a pattern P in a text T , when disjoint local swaps in the pattern are allowed. In the Approximate Pattern Matching problem with Swaps one seeks, for every text location with a swapped match of P , the number of swaps necessary to obtain a match at the location. In this paper, we present a new approach for solving both the Swap Matching problem and the Approximate Swap Matching problem in linear time, in the case of short patterns. In particular, we devise a $\mathcal{O}(nm)$ general algorithm, named Cross-Sampling , and show an efficient implementation of it, based on bit-parallelism, which achieves $\mathcal{O}(n)$ worst-case time and $\mathcal{O}(\sigma)$-space complexity, with patterns whose length is comparable to the word-size of the target machine.