Reversal Distance without Hurdles and Fortresses

@inproceedings{Bergeron2004ReversalDW,
  title={Reversal Distance without Hurdles and Fortresses},
  author={Anne Bergeron and Julia Mixtacki and Jens Stoye},
  booktitle={CPM},
  year={2004}
}
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. 

From This Paper

Topics from this paper.
43 Citations
12 References
Similar Papers

Similar Papers

Loading similar papers…