TY - GEN

T1 - Efficient Special Cases of Pattern Matching with Swaps

AU - Amihood, A.

AU - Landau, G.

AU - Lewenstein, M.

AU - Lewenstein, N.

N1 - Place of conference:New Jersey, USA

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 versionT′ of T is a length n string derived from T by a series of local swaps (i.e., t′l ← tl + 1 and t′l + 1 ← tl) 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 at location i of T′.
It was recently shown that the Pattern Matching with Swaps problem has a solution in time Full-size image (<1 K), where σ = 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ϵ ∑ where b ≠ a and b ≠ c and where the substring abc appears in the pattern. We show that for such patterns the Pattern Matching with Swaps problem can be solved in time O(nlog2m).

AB - Let a text string T of n symbols and a pattern string P of m symbols from alphabet ∑ be given. A swapped versionT′ of T is a length n string derived from T by a series of local swaps (i.e., t′l ← tl + 1 and t′l + 1 ← tl) 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 at location i of T′.
It was recently shown that the Pattern Matching with Swaps problem has a solution in time Full-size image (<1 K), where σ = 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ϵ ∑ where b ≠ a and b ≠ c and where the substring abc appears in the pattern. We show that for such patterns the Pattern Matching with Swaps problem can be solved in time O(nlog2m).

UR - https://scholar.google.co.il/scholar?q=Efficient+Special+Cases+of+Pattern+Matching+with+Swaps%2C+Amir+Amihood+&btnG=&hl=en&as_sdt=0%2C5

M3 - Conference contribution

BT - 9th Annual Combinatorial Pattern Matching Conference (CPM)

ER -