arXiv:1012.2547cs.DS
The Exact String Matching Problem: a Comprehensive Experimental Evaluation
Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.
Abstract
This paper 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, data compression, information retrieval, computational biology and chemistry. Since 1970 more than 80 string matching algorithms have been proposed, and more than 50% of them in the last ten years. In this note we present a comprehensive list of all string matching algorithms and present experimental results in order to compare them from a practical point of view. From our experimental evaluation it turns out that the performance of the algorithms are quite different for different alphabet sizes and pattern length.
Ruban shared links that lead to dead ends, but I've found the document talking about EPSM. https://arxiv.org/pdf/1012.2547v1.pdf It contains lots of benchmark results, but I don't understand how they can be useful for me, as I can't reproduce their way of benchmarking or how big…
MrYellowPView on HNParent context