Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2020.55
URN: urn:nbn:de:0030-drops-133991
URL: https://drops.dagstuhl.de/opus/volltexte/2020/13399/
Labarre, Anthony
Sorting by Prefix Block-Interchanges
| pdf-format: |
|
Abstract
We initiate the study of sorting permutations using prefix block-interchanges, which exchange any prefix of a permutation with another non-intersecting interval. The goal is to transform a given permutation into the identity permutation using as few such operations as possible. We give a 2-approximation algorithm for this problem, show how to obtain improved lower and upper bounds on the corresponding distance, and determine the largest possible value for that distance.
BibTeX - Entry
@InProceedings{labarre:LIPIcs:2020:13399,
author = {Anthony Labarre},
title = {{Sorting by Prefix Block-Interchanges}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {55:1--55:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Yixin Cao and Siu-Wing Cheng and Minming Li},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/13399},
URN = {urn:nbn:de:0030-drops-133991},
doi = {10.4230/LIPIcs.ISAAC.2020.55},
annote = {Keywords: permutations, genome rearrangements, interconnection network, sorting, edit distance, prefix block-interchange}
}
| Keywords: | permutations, genome rearrangements, interconnection network, sorting, edit distance, prefix block-interchange | |
| Seminar: | 31st International Symposium on Algorithms and Computation (ISAAC 2020) | |
| Issue date: | 2020 | |
| Date of publication: | 04.12.2020 |
