@InProceedings{zhang_et_al:LIPIcs.CPM.2018.14,
author = {Zhang, Shu and Zhu, Daming and Jiang, Haitao and Ma, Jingjing and Guo, Jiong and Feng, Haodi},
title = {{Can a permutation be sorted by best short swaps?}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {14:1--14:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.14},
URN = {urn:nbn:de:0030-drops-86957},
doi = {10.4230/LIPIcs.CPM.2018.14},
annote = {Keywords: Algorithm, Complexity, Short Swap, Permutation, Reversal}
}