Fig. 3From: Fast, accurate, and lightweight analysis of BS-treated reads with ERNE 2In the computation of h BS⊕(P), the bit-string α(P) is split in length-w blocks. All blocks except the last are non-overlapping and are taken from the beginning of α(P). The last block is taken from the end of α(P) and may overlap with the one preceding it. After this subdivision, all blocks are XOR-ed together, obtaining the fingerprint of P Back to article page