@InProceedings{charalampopoulos_et_al:LIPIcs.CPM.2020.10,
author = {Charalampopoulos, Panagiotis and Pissis, Solon P. and Radoszewski, Jakub and Wale\'{n}, Tomasz and Zuba, Wiktor},
title = {{Unary Words Have the Smallest Levenshtein k-Neighbourhoods}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {10:1--10:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.10},
URN = {urn:nbn:de:0030-drops-121359},
doi = {10.4230/LIPIcs.CPM.2020.10},
annote = {Keywords: combinatorics on words, Levenshtein distance, edit distance}
}