TY - GEN

T1 - Efficient special cases of pattern matching with swaps

AU - Amir, Amihood

AU - Landau, Gad M.

AU - Lewenstein, Moshe

AU - Lewenstein, Noa

PY - 1998

Y1 - 1998

N2 - 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).

AB - 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).

KW - Approximate pattern matching

KW - Combinatorial algorithms on words

KW - Design and analysis of algorithms

KW - Generalized pattern matching

KW - Pattern matching

KW - Pattern matching with swaps

UR - http://www.scopus.com/inward/record.url?scp=84877352958&partnerID=8YFLogxK

U2 - 10.1007/bfb0030791

DO - 10.1007/bfb0030791

M3 - Conference contribution

AN - SCOPUS:84877352958

SN - 3540647392

SN - 9783540647393

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 209

EP - 220

BT - Combinatorial Pattern Matching - 9th Annual Symposium, CPM 1998, Proceedings

PB - Springer Verlag

T2 - 9th Annual Symposium on Combinatorial Pattern Matching, CPM 1998

Y2 - 20 July 1998 through 22 July 1998

ER -