A new approach to text searching
Communications of the ACM
Fast text searching: allowing errors
Communications of the ACM
Text algorithms
Recursive hashing functions for n-grams
ACM Transactions on Information Systems (TOIS)
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)
Shift-or string matching with super-alphabets
Information Processing Letters
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
Multipattern string matching with q-grams
Journal of Experimental Algorithmics (JEA)
On a compact encoding of the swap automaton
Information Processing Letters
Hi-index | 0.00 |
We present a novel technique, suitable for bit-parallelism, for representing both the nondeterministic automaton and the nondeterministic suffix automaton of a given string in a more compact way. Our approach is based on a particular factorization of strings which on the average allows to pack in a machine word of w bits automata state configurations for strings of length greater than w. We adapted the Shift-And and BNDM algorithms using our encoding and compared them with the original algorithms. Experimental results show that the new variants are generally faster for long patterns.