Anthony Labarre. A New Tight Upper Bound on the Transposition Distance. In Rita Casadio, Gene Myers, editors, Algorithms in Bioinformatics, 5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings. Volume 3692 of Lecture Notes in Computer Science, pages 216-227, Springer, 2005. [doi]
We study the problem of computing the minimal number of adjacent, non-intersecting block interchanges required to transform a permutation into the identity permutation. In particular, we use the graph of a permutation to compute that number for a particular class of permutations in linear time and space, and derive a new tight upper bound on the so-called transposition distance.