A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is
A New String Matching Algorithm
International Journal of Computer Mathematics
In this paper a new exact string-matching algorithm with sub-linear average case complexity has been presented. Unlike other sub-linear string-matching algorithms it never performs more than n text character comparisons while working on a text of length n. It requires only O(m þ s) extra pre-processing time and space, where m is the length of the pattern and s is the size of the alphabet.doi:10.1080/0020716031000087113 fatcat:za5hjubc25acnjeyzlylcixi7e