On improving the average case of the Boyer-Moore string matching algorithm
Journal of Information Processing
Software—Practice & Experience
A very fast substring search algorithm
Communications of the ACM
A new approach to text searching
Communications of the ACM
Software—Practice & Experience
Fast string matching using an n-gram algorithm
Software—Practice & Experience
String matching in the DNA alphabet
Software—Practice & Experience
A fast string searching algorithm
Communications of the ACM
Fast and flexible string matching by combining bit-parallelism and suffix automata
Journal of Experimental Algorithmics (JEA)
NR-grep: a fast and flexible pattern-matching tool
Software—Practice & Experience
Shift-or string matching with super-alphabets
Information Processing Letters
Fast exact string matching algorithms
Information Processing Letters
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Improving practical exact string matching
Information Processing Letters
Exploiting SIMD instructions in current processors to improve classical string algorithms
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Hi-index | 0.04 |
Forward-SBNDM is a recently introduced variation of the BNDM algorithm for exact string matching. Forward-SBNDM inspects a 2-gram in the text such that the first character is the last one of an alignment window of the pattern and the second one is then outside the window. We present a generalization of this idea by inspecting several lookahead characters beyond an alignment window and integrate it with SBNDMq, a q-gram variation of BNDM. As a result, we get several new variations of SBNDMq. In addition, we introduce a greedy skip loop for SBNDM2. We tune up our algorithms and the reference algorithms with 2-byte read. According to our experiments, the best of the new variations are faster than the winners of recent algorithm comparisons for English, DNA, and binary data.