Research Article

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.

Data Set
PT PT PT PH PH PH FM FM FM

Citrus clementina 122 1094 5749 1642392 54 200 1377
Citrus sinensis 233 2229 12053 493611352 100 442 3501
Citrus trifoliata 30 223 1069 10.545158 24 92 660
C. elegans 381 3681 21390 1042411682 186 792 4806
SRR2244250 757 8111 30234 491516023 357 2340 16161
SRR500004 3502 20342 90321 25214148752 1787 6813 44907