Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: 2-Dimensional Palindromes with $k$ Mismatches   This paper extends the problem of 2-dimensional palindrome search into the
area of approximate matching. Using the Hamming distance as the measure, we
search for 2D palindromes that allow up to $k$ mismatches. We consider two
different definitions of 2D palindromes and describe efficient algorithms for
both of them. The first definition implies a square, while the second
definition (also known as a \emph{centrosymmetric factor}), can be any
rectangular shape. Given a text of size $n \times m$, the time complexity of
the first algorithm is $O(nm (\log m + \log n + k))$ and for the second
algorithm it is $O(nm(\log m + k) + occ)$ where $occ$ is the size of the
output.

10
The categories of this paper are: q-bio
34
The categories of this paper are: chem-ph
31
The categories of this paper are: ao-sci
28
The categories of this paper are: alg-geom
8
The categories of this paper are: hep-ex
37
The categories of this paper are: supr-con
29
The categories of this paper are: funct-an
7
The categories of this paper are: hep-th
14
The categories of this paper are: math-ph
24
The categories of this paper are: dg-ga
30
The categories of this paper are: q-alg
6
The categories of this paper are: astro-ph
15
The categories of this paper are: nucl-ex
33
The categories of this paper are: plasm-ph
12
The categories of this paper are: nucl-th
4
The categories of this paper are: cond-mat