In this article we present two efficient variants of the BOM string matching algorithm which are more efficient and flexible than the original algorithm. We also present bit-parallel versions of them obtaining an efficient variant of the BNDM algorithm. Then we compare the newly presented algorithms with some of the most recent and effective string matching algorithms. It turns out that the new proposed variants are very flexible and achieve very good results, especially in the case of large alphabets.
|Titolo:||Efficient Variants of the Backward-Oracle-Matching Algorithm|
|Data di pubblicazione:||2009|
|Appare nelle tipologie:||1.1 Articolo in rivista|