Same as #239, but when counting the number of intervals a particular hash/seed is sketched in, we consider an interval of length x as ceil(x/s) non-overlapping intervals (where s is the segment length). The ensures that frequent k-mers which often occur within s base-pairs of each other and therefore lead to long minmer intervals are not counted only once.
Same as #239, but when counting the number of intervals a particular hash/seed is sketched in, we consider an interval of length
xasceil(x/s)non-overlapping intervals (wheresis the segment length). The ensures that frequent k-mers which often occur withinsbase-pairs of each other and therefore lead to long minmer intervals are not counted only once.