On String Matching in Chunked Texts
We study exact string matching in special texts, which consist of consecutive fixed-length chunks where each position of a chunk has a character distribution of its own. This kind of setting can also be interpreted so that a chunk represents a character of a larger alphabet. If texts and patterns are of this kind, it may ruin the efficiency of common algorithms. We examine anomalies related to the Horspool and Sunday algorithms in this setting. In addition we present two new algorithms.
Keywordsstring matching experimental comparison Horspool algorithm
Unable to display preview. Download preview PDF.
- 2.Berry, T., Ravindran, S.: A fast string matching algorithm and experimental results. In: Proc. of the Prague Stringology Club Workshop 1999, Czech Technical University, Prague, Czech Republic, Collaborative Report DC-99-05, pp. 16–28 (1999)Google Scholar