Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: 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 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.

32
The categories of this paper are: atom-ph
17
The categories of this paper are: q-fin
24
The categories of this paper are: dg-ga
14
The categories of this paper are: math-ph
23
The categories of this paper are: solv-int
29
The categories of this paper are: funct-an
36
The categories of this paper are: cmp-lg
0
The categories of this paper are: hep-ph
25
The categories of this paper are: patt-sol
10
The categories of this paper are: q-bio
8
The categories of this paper are: hep-ex
6
The categories of this paper are: astro-ph
16
The categories of this paper are: stat
22
The categories of this paper are: chao-dyn
4
The categories of this paper are: cond-mat
12
The categories of this paper are: nucl-th