| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427694 | Information Processing Letters | 2010 | 5 Pages |
Abstract
We present improved variations of the BNDM algorithm for exact string matching. At each alignment our bit-parallel algorithms process a q-gram before testing the state variable. In addition we apply reading a 2-gram in one instruction. Our point of view is practical efficiency of algorithms. Our experiments show that the new variations are faster than earlier algorithms in many cases.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
