Saving comparisons in the Crochemore-Perrin string-matching algorithm
Theoretical Computer Science
Simple optimal string matching algorithm
Journal of Algorithms
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
A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching
CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Handbook of Exact String Matching Algorithms
Handbook of Exact String Matching Algorithms
Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm
Theoretical Computer Science
The wide window string matching algorithm
Theoretical Computer Science
Fast exact string matching algorithms
Information Processing Letters
Two Improved Single Pattern Matching Algorithms
ICAT '06 Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops
A simple fast hybrid pattern-matching algorithm
Journal of Discrete Algorithms
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
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
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
Fast Variants of the Backward-Oracle-Marching Algorithm
ICICSE '09 Proceedings of the 2009 Fourth International Conference on Internet Computing for Science and Engineering
Bit-(parallelism)2: getting to the next level of parallelism
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Practical and optimal string matching
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Fast multiple string matching using streaming SIMD extensions technology
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Efficient representation of DNA data for pattern recognition using failure factor oracles
Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference
| Hi-index | 0.00 |
This article addresses the online exact string matching problem which consists in finding all occurrences of a given pattern p in a text t. It is an extensively studied problem in computer science, mainly due to its direct applications to such diverse areas as text, image and signal processing, speech analysis and recognition, information retrieval, data compression, computational biology and chemistry. In the last decade more than 50 new algorithms have been proposed for the problem, which add up to a wide set of (almost 40) algorithms presented before 2000. In this article we review the string matching algorithms presented in the last decade and present experimental results in order to bring order among the dozens of articles published in this area.