An efficient algorithm for computing non-overlapping inversion and transposition distance

Given two strings of the same length n, the non-overlapping inversion and transposition distance (also called mutation distance) between them is defined as the minimum number of non-overlapping inversion and transposition operations used to transform one string into the other. In this study, we present an O(n3) time and O(n2) space algorithm to compute the mutation distance of two input strings.