A very fast substring search algorithm
Communications of the ACM
A fast string searching algorithm
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Some perils of performance prediction: a case study on pattern matching
Software—Practice & Experience
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
A String Matching Algorithm Fast on the Average
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Handbook of Exact String Matching Algorithms
Handbook of Exact String Matching Algorithms
Fast exact string matching algorithms
Information Processing Letters
Fast-search: a new efficient variant of the Boyer-Moore string matching algorithm
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
MDH: a high speed multi-phase dynamic hash string matching algorithm for large-scale pattern set
ICICS'07 Proceedings of the 9th international conference on Information and communications security
A partition-based efficient algorithm for large scale multiple-strings matching
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Free-gram phrase identification for modeling Chinese text
Information Processing Letters
| Hi-index | 0.89 |
A new algorithm based on the Wu-Manber algorithm for multiple string matching is presented in this paper. The algorithm eliminates the functional overlap of the table HASH and SHIFT, and computes the shift distances in an aggressive manner. After each test, the algorithm examines the character next to the scan window to maximize the shift distance. This idea is consistent with that of the quick-search (QS) algorithm. Experimental results on four alphabets show that the new algorithm is more efficient than Wu-Manber and other recent algorithms, particularly on short pattern sets and large alphabet.