Two Efficient Techniques to Find Approximate Overlaps between Sequences

Table 2

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

Data set
	PT	PT	PT	PH	PH	PH	FM	FM	FM
1 MB	1.8	10.6	45	0.5	0.5	1.2	3	17	120
5 MB	15	126.3	672	2.4	3.3	14	17	127	960
2.5 MB	4	27	109	1.34	2	3	4	13	82