Efficient special cases of pattern matching with swaps

Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Let a text string T of n symbols and a pattern string P of m symbols from alphabet be given. A swapped version T1 of T is a length n string derived from T by a series of local swaps, (i.e. t1f- tt+l and tt+1 t→ te) where each element can participate in no more than one swap. The Pattern Matching with Swaps problem is that of finding all locations i for which there exists a swapped version T of T where there is an exact matching of P in location i of Tq It was recently shown that the Pattern Matching with Swaps problem has a solution in time O(nm 1/3 log2 mlog2a), where a = min([], m). We consider some interesting special cases of patterns, namely, patterns where there is no length-one run, i.e. there are no a, b, c E where b a and b 7 c and where the substring abe appears in the pattern. We show that for such patterns the pattern matching with swaps problem can be solved in time O(n log2 m).

Original languageEnglish
Title of host publicationCombinatorial Pattern Matching - 9th Annual Symposium, CPM 1998, Proceedings
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3540647392, 9783540647393
StatePublished - 1998
Event9th Annual Symposium on Combinatorial Pattern Matching, CPM 1998 - Piscataway, NJ, United States
Duration: 20 Jul 199822 Jul 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1448 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference9th Annual Symposium on Combinatorial Pattern Matching, CPM 1998
Country/TerritoryUnited States
CityPiscataway, NJ


  • Approximate pattern matching
  • Combinatorial algorithms on words
  • Design and analysis of algorithms
  • Generalized pattern matching
  • Pattern matching
  • Pattern matching with swaps

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Efficient special cases of pattern matching with swaps'. Together they form a unique fingerprint.

Cite this