Skip to main content

Table 3 Cost of hashing strategies with three classes of seed. L: size of query sequence; w: total seed weight. By using efficient coding, only one entry is needed at each offset for a single transition seed.

From: Choosing the best heuristic for seeded alignment of DNA sequences

  1 BLASTZ seed 4 transition seeds with m = 2
# hash tables (lookups) 1 4
# entries per hash table wL L