A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
Pattern matching with swaps
Proceedings 38th Annual Symposium on Foundations of Computer Science
248 amir et al. Let a text string T of n symbols and a pattern string P of m symbols from alphabet be given. A swapped version T of T is a length n string derived from T by a series of local swaps (i.e., t ← t +1 and t +1 ← t ), 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 with an exact matching of P in location i of T . It has been an open problem whether
doi:10.1109/sfcs.1997.646103
dblp:conf/focs/AmirALLL97
fatcat:bhnpza5p7zhgjkpvdmiva4ktb4