Scout Algorithm For Fast Substring Matching
This addresses the need for a practical and efficient substring matching algorithm in software applications, but it appears incremental as it builds on existing methods without a major paradigm shift.
The authors tackled the problem of exact substring matching by introducing the Scout algorithm, which is straightforward, quick, and suitable for all applications, and compared its performance with several existing algorithms.
Exact substring matching is a common task in many software applications. Despite the existence of several algorithms for finding whether or not a pattern string is present in a target string, the most common implementation is a naïve, brute force approach. Alternative approaches either do not provide enough of a benefit for the added complexity, or are impractical for modern character sets, e.g., Unicode. We present a new algorithm, Scout, that is straightforward, quick and appropriate for all applications. We also compare the performance characteristics of the Scout algorithm with several others.