Software—Practice & Experience
A new approach to text searching
Communications of the ACM
Fast text searching: allowing errors
Communications of the ACM
String matching in the DNA alphabet
Software—Practice & Experience
A fast string searching algorithm
Communications of the ACM
Faster String Matching with Super-Alphabets
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
A general compression algorithm that supports fast searching
Information Processing Letters
Multi-patterns parameterized shift-and string matching algorithm with super alphabets
Proceedings of the International Conference on Advances in Computing, Communication and Control
Simple Random Access Compression
Fundamenta Informaticae
Fast Searching in Packed Strings
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
GRASPm: an efficient algorithm for exact pattern-matching in genomic sequences
International Journal of Bioinformatics Research and Applications
Improving practical exact string matching
Information Processing Letters
Software maintenance by multi-patterns parameterized string matching with q-gram
ACM SIGSOFT Software Engineering Notes
Parameterized string matching: an application to software maintenance
ACM SIGSOFT Software Engineering Notes
Simple compression code supporting random access and fast string matching
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Finding Significant Matches of Position Weight Matrices in Linear Time
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Fast searching in packed strings
Journal of Discrete Algorithms
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
Information and Computation
Approximate string matching with reduced alphabet
Algorithms and Applications
Simple Random Access Compression
Fundamenta Informaticae
Constant-Time word-size string matching
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Fast matching method for DNA sequences
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
String matching with lookahead
Discrete Applied Mathematics
| Hi-index | 0.89 |
Given a text T[1...n] and a pattern P[1...m] over some alphabet Σ of size σ, we want to find all the (exact) occurrences of P in T. The well-known shift-or algorithm solves this problem in time O(n⌈m/w⌉), where w is the number of bits in machine word, using bit-parallelism. We show how to extend the bit-parallelism in another direction, using super-alphabets. This gives a speed-up by a factor s, where s is the number of characters processed simultaneously. The algorithm is implemented, and we show that it works well in practice too. The result is the fastest known algorithm for exact string matching for short patterns and small alphabets.