An Improved Hashing Approach for Biological Sequence to Solve Exact Pattern Matching Problems

Table 2

The time complexity of different string-matching algorithms.

Algorithms	Time complexity	Data
BF [23]	O(mn)	All datasets
BM [24]	O(mn)	All datasets
QS [29]	O(mn)	All datasets
BFM [30]	O(mn)	All datasets
MS [32]	Best case: O(n/(m + 1)); Worst case: O(nm)	All datasets
MAC [33]	O(nm)	All datasets
EHM [19]	O(nm)	All datasets
Hash-q [36]	Best case: O(n/(m − q)); Worst case: O(nm)	DNA datasets
HqUF [38]	Best case: O(n/(m − q)); Worst case: O(n(m − q))	DNA datasets
HAPM	Best case: O(n/(m + 1)); Worst case: O(nm)	All datasets