ProGeRF: Proteome and Genome Repeat Finder Utilizing a Fast Parallel Hash Function

Figure 3

Creating repetitive element hash table: Step  1: sliding window maps each motif of the sequence for a position in the repetitive element hash table and sets value 1 to mapped position, and add or remove the sliding window to single bucket; Step  2: check whether the current sliding window is a degeneration of some motif ever recorded in buckets of REHT; Step  3: for each existing degeneration in the buffer the function is applied and then converted into an integer and, soon after, Step  1 is performed.