Using swaps and deletes to make strings match

Given a source and a target string, their swap–delete–edit distance is the minimum number of interchange-consecutive-symbols and delete operations applied to the source string to make it equal the target string. We show that the swap–delete–edit distance of strings over alphabets of bounded size can be computed in polynomial time.