The edit distance (a.k.a. the Levenshtein distance) between two words is defined as the minimum number of insertions, deletions or substitutions of letters needed to transform one word into another. The Levenshtein k-neighbourhood of a word w is the set of words that are at edit distance at most k from w. This is perhaps the most important concept underlying BLAST, a widely-used tool for comparing biological sequences. A natural combinatorial question is to ask for upper and lower bounds on the size of this set. The answer to this question has important algorithmic implications as well. Myers notes that "such bounds would give a tighter characterisation of the running time of the algorithm" behind BLAST. We show that the size of the Levenshtein k-neighbourhood of any word of length n over an arbitrary alphabet is not smaller than the size of the Levenshtein k-neighbourhood of a unary word of length n, thus providing a tight lower bound on the size of the Levenshtein k-neighbourhood. We remark that this result was posed as a conjecture by Dufresne at WCTA 2019. 2012 ACM Subject Classification Theory of computation ! Pattern matching.

, ,
31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020
Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands

Charalampopoulos, P, Pissis, S, Radoszewski, J, Waleń, T, & Zuba, W.P. (2020). Unary Words Have the Smallest Levenshtein k-Neighbourhoods. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.CPM.2020.10