DeepAI AI Chat
Log In Sign Up

Scout Algorithm For Fast Substring Matching

by   Anand Natrajan, et al.

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.


page 1

page 2

page 3

page 4


Optimal-Hash Exact String Matching Algorithms

String matching is the problem of finding all the occurrences of a patte...

Fast Cartesian Tree Matching

Cartesian tree matching is the problem of finding all substrings of a gi...

Vectorized Character Counting for Faster Pattern Matching

Many modern sequence alignment tools implement fast string matching usin...

When a Dollar Makes a BWT

The Burrows-Wheeler-Transform (BWT) is a reversible string transformatio...

A novel algorithm for online inexact string matching and its FPGA implementation

Accelerating inexact string matching procedures is of utmost importance ...

Self-Bounded Prediction Suffix Tree via Approximate String Matching

Prediction suffix trees (PST) provide an effective tool for sequence mod...

Novel Keyword Extraction and Language Detection Approaches

Fuzzy string matching and language classification are important tools in...