A comparison between between Aho-Corasick algorithm and Rabin-Karp algorithm
I am working on multiple patterns search matching algorithms and I found
that two algorithms are the strongest candidates, namely Aho-Corasick and
Rabin-Karp in terms of running time. However, there are few things still
foggy. I could not find any comprehensive explicit comparison between the
two algorithms. Besides, what I need to know is which one is more suitable
for parallel computing and multiple patterns search. What is the time
complexity of each one of them and which one required less hardware
resources.
No comments:
Post a Comment