Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Linear Approximate Pattern Matching Algorithm   Pattern matching is a fundamental process in almost every scientific domain.
The problem involves finding the positions of a given pattern (usually of short
length) in a reference stream of data (usually of large length). The matching
can be as an exact or as an approximate (inexact) matching. Exact matching is
to search for the pattern without allowing for mismatches (or insertions and
deletions) of one or more characters in the pattern), while approximate
matching is the opposite. For exact matching, several data structures that can
be built in linear time and space are used and in practice nowadays. For
approximate matching, the solutions proposed to solve this matching are
non-linear and currently impractical. In this paper, we designed and
implemented a structure that can be built in linear time and space and solve
the approximate matching problem in ($O(m + \frac {log_\Sigma ^kn}{k!} + occ$)
search costs, where $m$ is the length of the pattern, $n$ is the length of the
reference, and $k$ is the number of tolerated mismatches (and insertion and
deletions).

26
The categories of this paper are: bayes-an
22
The categories of this paper are: chao-dyn
28
The categories of this paper are: alg-geom
35
The categories of this paper are: mtrl-th
21
The categories of this paper are: adap-org
5
The categories of this paper are: gr-qc
19
The categories of this paper are: eess
14
The categories of this paper are: math-ph
2
The categories of this paper are: math
4
The categories of this paper are: cond-mat
30
The categories of this paper are: q-alg
27
The categories of this paper are: comp-gas
34
The categories of this paper are: chem-ph
6
The categories of this paper are: astro-ph
13
The categories of this paper are: quant-ph
32
The categories of this paper are: atom-ph