A new model to solve the swap matching problem and efficient algorithms for short patterns

Authors:
Costas S. Iliopoulos;M. Sohel Rahman
Affiliations:
Algorithm Design Group, Department of Computer Science, King's College London, Strand, London, England;Algorithm Design Group, Department of Computer Science, King's College London, Strand, London, England
Venue:
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Year:
2008

Citing 7
Cited 6

A new approach to text searching

Communications of the ACM
Efficient special cases of Pattern Matching with Swaps

Information Processing Letters
Pattern matching with swaps

Journal of Algorithms
Approximate swapped matching

Information Processing Letters
Overlap matching

Information and Computation
Handbook of Exact String Matching Algorithms

Handbook of Exact String Matching Algorithms
String matching with swaps in a weighted sequence

CIS'04 Proceedings of the First international conference on Computational and Information Science

Pattern Matching with Swaps for Short Patterns in Linear Time

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Average-optimal string matching

Journal of Discrete Algorithms
On shortest common superstring and swap permutations

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
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
A graph-theoretic model to solve the approximate string matching problem allowing for translocations

Journal of Discrete Algorithms
On a compact encoding of the swap automaton

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we revisit the much studied problem of Pattern matching with Swaps (Swap Matching problem, for short). We first present a new graph-theoretic approach to model the problem, which opens a new and so far unexplored avenue to solve the problem. Then, using the model, we devise an efficient algorithm to solve the swap matching problem. The resulting algorithm is an adaptation of the classic shiftor algorithm. For patterns having length similar to the word-size of the target machine, the algorithm runs in O(n log m) time, where n and m are the length of the text and the pattern respectively.