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 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\log k(nm+occ))$ where occ is the size of the output.

本文将二维回文搜索的问题扩展到近似匹配的领域。使用汉明距离作为度量，我们搜索允许多达k个不匹配的2D回文。我们考虑2D回文的两种不同定义，并为它们描述有效的算法。第一个定义表示一个正方形，而第二个定义（也称为中心对称因子）可以是任何矩形。给定文本大小$（ñ\times 米）$，第一个算法的时间复杂度是 $Ø（ñ米（\mathrm{日志}米+\mathrm{日志}ñ+ķ））$ 第二种算法是 $Ø（ñ米\mathrm{日志}米+ķ\mathrm{日志}ķ（ñ米+ØCC））$其中occ是输出的大小。