• Citer

A new tight upper bound on the transposition distance

par Labarre, Anthony
Référence Lecture notes in computer science, 3692 LNBI, page (216-227)
Publication Publié, 2005

Article révisé par les pairs

• Détails
• Contenu

Résumé :

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. © Springer-Verlag Berlin Heidelberg 2005.