Figure 1

Hash Table Insertion Pseudo Code. Pseudo code for hash table insertion applied to alignments read from the input file. If an alignment B with an identical hash value h to that of the new alignment A is present, then either a pair is detected and appended to the output list O or we have a collision between a previous alignment B and need to move B to the list L before we can insert A into H. If there is no alignment for the hash value h yet, then the new alignment is inserted into H.