Fig. 2From: Fast, accurate, and lightweight analysis of BS-treated reads with ERNE 2A Hamming-aware hash function collapses the k-radius Hamming ball centered on the pattern P to a \(\mathcal {O}(k)\)-radius Hamming ball centered on the hash h(P) of P. The latter sphere contains much less elements since |h(P)|≪|P|. In this picture, true positives (i.e. sequences that occur in the reference and whose hash values occur in the hash of the reference) are represented as green dots, true negatives (i.e. sequences that do not occur in the reference and whose hash values do not occur in the hash of the reference) are represented as gray dots, and false positives (i.e. sequences that do not occur in the reference and whose hash values occur in the hash of the reference) are represented as red dots. False negatives are not depicted here since they cannot be introduced by our hashing schemeBack to article page