Checking whether a word is Hamming-isometric in linear time
Abstract
A finite word is Hamming-isometric if for any two word and of same length avoiding , can be transformed into by changing one by one all the letters on which differs from , in such a way that all of the new words obtained in this process also avoid~. Words which are not Hamming-isometric have been characterized as words having a border with two mismatches. We derive from this characterization a linear-time algorithm to check whether a word is Hamming-isometric. It is based on pattern matching algorithms with mismatches. Lee-isometric words over a four-letter alphabet have been characterized as words having a border with two Lee-errors. We derive from this characterization a linear-time algorithm to check whether a word over an alphabet of size four is Lee-isometric.
Keywords
Cite
@article{arxiv.2106.10541,
title = {Checking whether a word is Hamming-isometric in linear time},
author = {Marie-Pierre Béal and Maxime Crochemore},
journal= {arXiv preprint arXiv:2106.10541},
year = {2022}
}