METHOD OF OPTIMIZED SEARCH SIMILAR BINARY STRINGS IN A CERTAIN SET
Abstract
The article deals with the problem of the rapid finding of similar strings in a certain set of binary strings with the same length, for which the Hamming distance does not exceed a given value.
Key words: Hamming distance, binary string, hash table.
Tabl.: 2. Bibl.: 2.