Approximation Algorithms For Sorting Lambda-Permutations By Lambda-Operations

Understanding how different two organisms are is one question addressed by the comparative genomics field. A well-accepted way to estimate the evolutionary distance between genomes of two organisms is finding the rearrangement distance, which is the smallest number of rearrangements needed to transform one genome into another. By representing genomes as permutations, one of them can be represented as the identity permutation, and, so, we reduce the problem of transforming one permutation into another to the problem of sorting a permutation using the minimum number of rearrangements. This work investigates the problems of sorting permutations using reversals and/or transpositions, with some additional restrictions of biological relevance. Given a value lambda, the problem now is how to sort a lambda-permutation, which is a permutation whose elements are less than lambda positions away from their correct places (regarding the identity), by applying the minimum number of rearrangements. Each lambda-rearrangement must have size, at most, lambda, and, when applied to a lambda-permutation, the result should also be a lambda-permutation. We present algorithms with approximation factors of O(lambda(2)), O(lambda), and O(1) for the problems of Sorting lambda-Permutations by lambda-Reversals, by lambda-Transpositions, and by both operations.