Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

2-Dimensional Palindromes with $k$ Mismatches (2002.11157v1)

Published 25 Feb 2020 in cs.DS

Abstract: 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.

Summary

We haven't generated a summary for this paper yet.