Checking whether a word is Hamming-isometric in linear time

A finite word f is Hamming-isometric if for any two words u and v of the same length avoiding f, can be transformed into by changing one all letters on which differs from v, in such a way that new obtained this process also avoid f. Words are not have been characterized as having border with mismatches. We derive characterization linear-time algorithm to check whether Hamming-isometric. It based pattern matching algorithms k Lee-isometric over four-letter alphabet Lee-errors. an size four Lee-isometric.