Two Efficient Techniques to Find Approximate Overlaps between Sequences

Figure 2

A demonstration for the pigeonhole principle. Every prefix of size from every read is divided into 4 parts. Each part is inserted in its appropriate index. Then, each candidate suffix is divided into 4 parts and each part is searched for in the corresponding index. If there is a match, then we compare with the prefix of the matching string.