Improving practical exact string matching

Authors:
Branislav Ďurian;Jan Holub;Hannu Peltola;Jorma Tarhio
Affiliations:
S&T Varias s.r.o., Priemyselnáá 2, SK-010 01 Žilina, Slovakia;Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Kolejní 550/2, CZ-160 00, Prague 6, Czech Republic;Department of Computer Science and Engineering, Helsinki University of Technology, PO Box 5400, FI-02015 TKK, Finland;Department of Computer Science and Engineering, Helsinki University of Technology, PO Box 5400, FI-02015 TKK, Finland
Venue:
Information Processing Letters
Year:
2010

Citing 14
Cited 4

A very fast substring search algorithm

Communications of the ACM
A new approach to text searching

Communications of the ACM
Fast string searching

Software—Practice & Experience
Fast string matching using an n-gram algorithm

Software—Practice & Experience
Text algorithms

Text algorithms
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
Factor Oracle: A New Structure for Pattern Matching

SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Shift-or string matching with super-alphabets

Information Processing Letters
The wide window string matching algorithm

Theoretical Computer Science
Fast exact string matching algorithms

Information Processing Letters
A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching

ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Practical and optimal string matching

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval

Software maintenance by multi-patterns parameterized string matching with q-gram

ACM SIGSOFT Software Engineering Notes
Average complexity of backward q-gram string matching algorithms

Information Processing Letters
Free-gram phrase identification for modeling Chinese text

Information Processing Letters
String matching with lookahead

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present improved variations of the BNDM algorithm for exact string matching. At each alignment our bit-parallel algorithms process a q-gram before testing the state variable. In addition we apply reading a 2-gram in one instruction. Our point of view is practical efficiency of algorithms. Our experiments show that the new variations are faster than earlier algorithms in many cases.