License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CPM.2016.19
URN: urn:nbn:de:0030-drops-60752
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6075/
Go to the corresponding LIPIcs Volume Portal

Geizhals, Sara ; Sokol, Dina

Finding Maximal 2-Dimensional Palindromes

pdf-format:
LIPIcs-CPM-2016-19.pdf (1.0 MB)

Abstract

This paper extends the problem of palindrome searching into a higher dimension, addressing two definitions of 2D palindromes. The first definition implies a square, while the second definition (also known as a centrosymmetric factor), can be any rectangular shape. We describe two algorithms for searching a 2D text for maximal palindromes, one for each type of 2D palindrome. The first algorithm is optimal; it runs in linear time, on par with Manacher's linear time 1D palindrome algorithm. The second algorithm searches a text of size n_1 x n_2 (n_1 >= n_2) in O(n_2) time for each of its n_1 x n_2 positions. Since each position may have up to O(n_2) maximal palindromes centered at that location, the second result is also optimal in terms of the worst-case output size.

BibTeX - Entry

@InProceedings{geizhals_et_al:LIPIcs:2016:6075,
  author =	{Sara Geizhals and Dina Sokol},
  title =	{{Finding Maximal 2-Dimensional Palindromes}},
  booktitle =	{27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)},
  pages =	{19:1--19:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-012-5},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{54},
  editor =	{Roberto Grossi and Moshe Lewenstein},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6075},
  URN =		{urn:nbn:de:0030-drops-60752},
  doi =		{10.4230/LIPIcs.CPM.2016.19},
  annote =	{Keywords: palindrome, pattern matching, 2-Dimensional, centrosymmetric factor}
}

Keywords: palindrome, pattern matching, 2-Dimensional, centrosymmetric factor
Collection: 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)
Issue Date: 2016
Date of publication: 27.06.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI