Finding maximal 2-dimensional palindromes

DOI10.4230/LIPICS.CPM.2016.19MaRDI QIDQ5369554zbMATH OpenFDO

Authors Sara H. Geizhals, Dina Sokol

Publication date 17 October 2017

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2016.19

zbMATH Keywords

2-dimensionalcentrosymmetric factorpalindromepattern matching

Mathematics Subject Classification ID

Algorithms on strings (68W32) Analysis of algorithms (68W40)

Recommendations

• Finding maximal 2-dimensional palindromes
• 2-dimensional palindromes with k mismatches
• Palindrome pattern matching
• Palindrome pattern matching
• Two-dimensional maximal repetitions

Cited in

(8)

• Finding maximal 2-dimensional palindromes
• 2-dimensional palindromes with k mismatches
• On the least number of palindromes in two-dimensional words
• Palindrome pattern matching
• scientific article; zbMATH DE number 5501412 (Why is no real title available?)
• Small-space LCE data structure with constant-time queries
• Two-dimensional palindromes and their properties
• Palindromic characteristic of committed graphs and some model theoretic properties

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5369554)