A new approach to text searching
Communications of the ACM
A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching
CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Increased bit-parallelism for approximate and multiple string matching
Journal of Experimental Algorithmics (JEA)
The wide window string matching algorithm
Theoretical Computer Science
A programmable array processor architecture for flexible approximate string matching algorithms
Journal of Parallel and Distributed Computing
Pipelined Parallel AC-Based Approach for Multi-String Matching
ICPADS '08 Proceedings of the 2008 14th IEEE International Conference on Parallel and Distributed Systems
A multiple sliding windows approach to speed up string matching algorithms
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
The exact online string matching problem: A review of the most recent results
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
We investigate the problem of getting to a higher instruction-level parallelism in string matching algorithms. In particular, starting from an algorithm based on bit-parallelism, we propose two flexible approaches for boosting it with a higher level of parallelism. These approaches are general enough to be applied to other bit-parallel algorithms. It turns out that higher levels of parallelism lead to more efficient solutions in practical cases, as demonstrated by an extensive experimentation.