Skip to main content
. 2006 Mar 13;7:133. doi: 10.1186/1471-2105-7-133

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.

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