| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4950786 | Information Processing Letters | 2017 | 5 Pages |
Abstract
String matching is the process of finding the number of occurrences of a pattern P of length m in a text T of length n, where in practice m is much smaller than n. In this paper, we present a faster variation of HASHq based on improved hashing and greedy skip. Experimental results confirm that the proposed algorithm, namely FHASHq, is faster than HASHq, SBNDMq and FSBNDM algorithms on alphabets of size 4 (DNA alphabet), 128, 256, and 512.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Abdulrakeeb M. Al-Ssulami, Hassan Mathkour,