Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A practical index for approximate dictionary matching with few
  mismatches   Approximate dictionary matching is a classic string matching problem
(checking if a query string occurs in a collection of strings) with
applications in, e.g., spellchecking, online catalogs, geolocation, and web
searchers. We present a surprisingly simple solution called a split index,
which is based on the Dirichlet principle, for matching a keyword with few
mismatches, and experimentally show that it offers competitive space-time
tradeoffs. Our implementation in the C++ language is focused mostly on data
compaction, which is beneficial for the search speed (e.g., by being cache
friendly). We compare our solution with other algorithms and we show that it
performs better for the Hamming distance. Query times in the order of 1
microsecond were reported for one mismatch for the dictionary size of a few
megabytes on a medium-end PC. We also demonstrate that a basic compression
technique consisting in $q$-gram substitution can significantly reduce the
index size (up to 50% of the input text size for the DNA), while still keeping
the query time relatively low.

17
The categories of this paper are: q-fin
20
The categories of this paper are: acc-phys
28
The categories of this paper are: alg-geom
24
The categories of this paper are: dg-ga
21
The categories of this paper are: adap-org
11
The categories of this paper are: hep-lat
18
The categories of this paper are: econ
0
The categories of this paper are: hep-ph
25
The categories of this paper are: patt-sol
15
The categories of this paper are: nucl-ex
16
The categories of this paper are: stat
14
The categories of this paper are: math-ph
23
The categories of this paper are: solv-int
7
The categories of this paper are: hep-th
3
The categories of this paper are: physics
29
The categories of this paper are: funct-an