Abstract
An underlying assumption in the classical sorting problem is that the sorter does not know the index of every element in the sorted array. Thus, comparisons are used to determine the order of elements, while the sorting is done by interchanging elements. In the closely related interchange rearrangement problem, final positions of elements are already given, and the cost of the rearrangement is the cost of the interchanges. This problem was studied only for the limited case of permutation strings, where every element appears once. This paper studies a generalization of the classical and well-studied problem on permutations by considering general strings input, thus solving an open problem of Cayley from 1849, and examining various cost models.
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
Bergeron, A.: A very elementary presentation of the Hannenhalli-Pevzner theory. Discrete Applied Mathematics 146(2), 134–145 (2005)
Caprara, A.: Sorting permutations by reversals and Eulerian cycle decompositions. SIAM journal on discrete mathematics 12(1), 91–110 (1999)
Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. Journal of the ACM 46, 1–27 (1999)
Bafna, V., Pevzner, P.: Sorting by transpositions. SIAM J. on Disc. Math. 11, 221–240 (1998)
Hannenhalli, S.: Polynomial algorithm for computing translocation distance between genomes. Discrete Applied Mathematics 71, 137–151 (1996)
Christie, D.A.: Sorting by block-interchanges. Information Processing Letters 60, 165–169 (1996)
Heath, L.S., Vergara, P.C.: Sorting by short swaps. J. of Comp. Biology 10(5), 775–789 (2003)
Christie, D.A.: Genome Rearrangement Problems. PhD thesis, University of Glasgow (1999)
Radcliff, A.J., Scott, A.D., Wilmer, E.L.: Reversals and transpositions over finite alphabets. SIAM journal on discrete mathematics 19, 224–244 (2005)
Cayley, A.: Note on the theory of permutations. Philosophical Magazine 34, 527–529 (1849)
Jerrum, M.R.: The complexity of finding minimum-length generator sequences. Theoretical Computer Science 36, 265–289 (1985)
Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: Rearrangement distances. In: Proc. 17th SODA, pp. 1221–1229 (2006)
Bender, M.A., Ge, D., He, S., Hu, H., Pinter, R.Y., Skiena, S., Swidan, F.: Improved bounds on sorting with length-weighted reversals. In: Proc. 15th SODA, pp. 912–921 (2004)
Holyer, I.: The NP-completeness of some edge-partition problems. SIAM Journal of Computing 10(4), 713–717 (1981)
Knuth, D.E.: The Art of Computer Programming. In: Sorting and Searching, Reading, Mass, vol. 3, Addison-Wesley, London, UK (1973)
Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmoc efficiency for network flow problems. Journal of The ACM (JACM) 19(2), 248–264 (1972)
Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. Journal of The ACM (JACM) 34(3), 596–615 (1987)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amir, A., Hartman, T., Kapah, O., Levy, A., Porat, E. (2007). On the Cost of Interchange Rearrangement in Strings. In: Arge, L., Hoffmann, M., Welzl, E. (eds) Algorithms – ESA 2007. ESA 2007. Lecture Notes in Computer Science, vol 4698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75520-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-75520-3_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75519-7
Online ISBN: 978-3-540-75520-3
eBook Packages: Computer ScienceComputer Science (R0)