Scout Algorithm For Fast Substring Matching

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\"ive, brute force approach. Alternative approaches either do not...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Natrajan, Anand, Mallige Anand
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 08.11.2020
Subjects
Algorithms
Applications programs
Matching
Strings
Online AccessGet full text

Cover

More Information
Summary: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\"ive, 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.
ISSN:2331-8422