Two Efficient Techniques to Find Approximate Overlaps between Sequences

Table 3

Time consumptions for prefix tree (PT), pigeonhole (PH), and FM solutions to find approximate overlaps using different values for allowed mismatches (m). Time is shown in seconds.

	PT	PH	FM
1 MB	2.3	4	9
5 MB	6.5	14.5	40
2.5 MB	2.5	4	21