The Swap Matching Problem Revisited

  title={The Swap Matching Problem Revisited},
  author={Pritom Ahmed and Costas S. Iliopoulos and A. S. M. Shohidull Islam and Mohammad Sohel Rahman},
  journal={Theor. Comput. Sci.},
In this paper, we revisit the much studied problem of Pattern Matching with Swaps (Swap Matching problem, for short). We first present a graph-theoretic model, which opens a new and so far unexplored avenue to solve the problem. Then, using the model, we devise two efficient algorithms to solve the swap matching problem. The resulting algorithms are adaptations of the classic shift-and algorithm. For patterns having length similar to the word-size of the target machine, both the algorithms run… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 10 references

Matching with Swaps for Short Pattern in Linear Time

  • D. Cantone, S. Faro Patter
  • In SOFSEM 2009: Theory and practice of Computer…
  • 2009
Highly Influential
10 Excerpts

A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns

  • C.S.Iliopoulos, M.Sohel Rahman
  • In SOFSEM 2008: volume 4910 of Lecture Notes in…
  • 2008
3 Excerpts

Similar Papers

Loading similar papers…