Two Efficient Techniques to Find Approximate Overlaps between Sequences
Table 4
Time consumptions for prefix tree (PT), pigeonhole (PH) and FM solutions to find approximate overlaps when real data is used on a capable AWS node. Time is shown in seconds.