Computes an upper unique hash value of a shape applied to a sequence, even if the sequence is shorter than the shape span.
Shape to be used for hashing.
Sequence iterator pointing to the first character of the shape.
The distance of
This function in conjunction with hash2 is useful to search a q-gram index for p-grams with p<q.
Upper hash value of the shape. The hash value corresponds to the maximal hash2 value of a shape beginning with the
min(charsLeft,length(shape)) characters + 1
SeqAn - Sequence Analysis Library - www.seqan.de