Finding maximal 2-dimensional palindromes

DOI10.1016/j.ic.2019.03.001zbMath1476.68316OpenAlexW2920973612WikidataQ128265670 ScholiaQ128265670MaRDI QIDQ1740657

Sara H. Geizhals, Dina Sokol

Publication date: 2 May 2019

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6075/

zbMATH Keywords

pattern matching2-dimensional palindromescentrosymmetric factor

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (4)

Enumeration of two dimensional palindromes ⋮ HV-Palindromes in Two-Dimensional Words ⋮ 2-dimensional palindromes with \(k\) mismatches ⋮ Double string tandem repeats

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient retrieval of approximate palindromes in a run-length encoded string
• Efficient algorithms to compute compressed longest common substrings and compressed palindromes
• Two-dimensional dictionary matching
• On-line construction of suffix trees
• Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
• Fast Algorithms for Finding Nearest Common Ancestors
• Searching for Gapped Palindromes
• Finding All Approximate Gapped Palindromes
• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• A Linear-Time On-Line Recognition Algorithm for ``Palstar
• Fast Pattern Matching in Strings
• Fast parallel and serial approximate string matching
• A Generalization of the Suffix Tree to Square Matrices, with Applications
• Approximate On-line Palindrome Recognition, and Applications
• Optimal parallel algorithms for periods, palindromes and squares
• Two-Dimensional Palindromes and Their Properties

This page was built for publication: Finding maximal 2-dimensional palindromes