The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
The Exact String Matching Problem: a Comprehensive Experimental Evaluation
[article]
2010
arXiv
pre-print
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
arXiv:1012.2547v1
fatcat:eie54bnkszeilbt5powdjwxz7i