Abstract
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation. Their solution, as well as subsequent ones, relies on many intermediary constructions, such as simulations with permutations on 2n elements, and manipulation of various graphs.
Here we give the first completely elementary treatment of this problem. We characterize safe reversals and hurdles working directly on the origi- nal signed permutation. Moreover, our presentation leads to polynomial algorithms that can be efficiently implemented using bit-wise operations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Piotr Berman, Sridhar Hannenhalli, Fast Sorting by Reversal. CPM 1996, LNCS 1075: 168–185.
Alberto Caprara, Sorting by reversals is difficult. RECOMB 1997, ACM Press: 75–83.
Sridhar Hannenhalli, Pavel A. Pevzner, Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals. JACM 46(1): 1–27 (1999).
Haim Kaplan, Ron Shamir, Robert Tarjan, A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. SIAM J. Comput. 29(3): 880–892 (1999).
Pavel Pevzner, Computational Molecular Biology, MIT Press, Cambridge, Mass., 314_p., (2000).
David Sankoff, Edit Distances for Genome Comparisons Based on Non-Local Operations. CPM 1992, LNCS 644,: 121–135.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bergeron, A. (2001). A Very Elementary Presentation of the Hannenhalli-Pevzner Theory. In: Amir, A. (eds) Combinatorial Pattern Matching. CPM 2001. Lecture Notes in Computer Science, vol 2089. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48194-X_9
Download citation
DOI: https://doi.org/10.1007/3-540-48194-X_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42271-6
Online ISBN: 978-3-540-48194-2
eBook Packages: Springer Book Archive