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. © Springer-Verlag Berlin Heidnlberg 2007.
CITATION STYLE
Amir, A., Hartman, T., Kapah, O., Levy, A., & Porat, E. (2007). On the cost of interchange rearrangement in strings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4698 LNCS, pp. 99–110). Springer Verlag. https://doi.org/10.1007/978-3-540-75520-3_11
Mendeley helps you to discover research relevant for your work.