Reversal Distance without Hurdles and Fortresses

Abstract. This paper presents an elementary proof of the HannenhalliPevzner theorem on the reversal distance of two signed permutations. It uses a single PQ-tree to encode the various features of a permutation. The parameters called hurdles and fortress are replaced by a single one, whose value is computed by a simple and efficient algorithm.

• Type: Conference
• Year: 2004
• Where: CPM
• Authors: Anne Bergeron, Julia Mixtacki, Jens Stoye
• Keywords: CPM 2004, Elementary Proof, Parameters Called Hurdles, Signed Permutations