On the cost of interchange rearrangement in strings

Amihood Amir; Tzvika Hartman; Oren Kapah; Avivit Levy; Ely Porat

doi:10.1007/978-3-540-75520-3_11

On the cost of interchange rearrangement in strings

Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

19 Scopus citations

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.

Original language	English
Title of host publication	Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings
Publisher	Springer Verlag
Pages	99-110
Number of pages	12
ISBN (Print)	9783540755197
DOIs	https://doi.org/10.1007/978-3-540-75520-3_11
State	Published - 2007
Event	15th Annual European Symposium on Algorithms, ESA 2007 - Eilat, Israel Duration: 8 Oct 2007 → 10 Oct 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4698 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	15th Annual European Symposium on Algorithms, ESA 2007
Country/Territory	Israel
City	Eilat
Period	8/10/07 → 10/10/07

Access to Document

10.1007/978-3-540-75520-3_11

Cite this

Amir, A., Hartman, T., Kapah, O., Levy, A., & Porat, E. (2007). On the cost of interchange rearrangement in strings. In Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings (pp. 99-110). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4698 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-75520-3_11

@inproceedings{e43ffff778264eb59d51427fdac982c5,

title = "On the cost of interchange rearrangement in strings",

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.",

author = "Amihood Amir and Tzvika Hartman and Oren Kapah and Avivit Levy and Ely Porat",

year = "2007",

doi = "10.1007/978-3-540-75520-3_11",

language = "אנגלית",

isbn = "9783540755197",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "99--110",

booktitle = "Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings",

address = "גרמניה",

note = "15th Annual European Symposium on Algorithms, ESA 2007 ; Conference date: 08-10-2007 Through 10-10-2007",

}

Amir, A, Hartman, T, Kapah, O, Levy, A & Porat, E 2007, On the cost of interchange rearrangement in strings. in Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4698 LNCS, Springer Verlag, pp. 99-110, 15th Annual European Symposium on Algorithms, ESA 2007, Eilat, Israel, 8/10/07. https://doi.org/10.1007/978-3-540-75520-3_11

On the cost of interchange rearrangement in strings. / Amir, Amihood; Hartman, Tzvika; Kapah, Oren et al.
Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings. Springer Verlag, 2007. p. 99-110 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4698 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On the cost of interchange rearrangement in strings

AU - Amir, Amihood

AU - Hartman, Tzvika

AU - Kapah, Oren

AU - Levy, Avivit

AU - Porat, Ely

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=38049064030&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-75520-3_11

DO - 10.1007/978-3-540-75520-3_11

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:38049064030

SN - 9783540755197

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 99

EP - 110

BT - Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings

PB - Springer Verlag

T2 - 15th Annual European Symposium on Algorithms, ESA 2007

Y2 - 8 October 2007 through 10 October 2007

ER -

Amir A, Hartman T, Kapah O, Levy A, Porat E. On the cost of interchange rearrangement in strings. In Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings. Springer Verlag. 2007. p. 99-110. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-75520-3_11

On the cost of interchange rearrangement in strings

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this