Pattern matching with swaps

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^´ _l←t_l+1 and t´_l+1←t_l) 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 T´. It has been an open problem whether swapped matching can be done in less than O(mn) time. In this paper we show the first algorithm that solves the pattern matching with swaps problem in time O(mn). We present an algorithm whose time complexity is O(nm^1/3 log m log² σ) for a general alphabet Σ, where σ=min(m, |Σ|)