2-dimensional palindromes with \(k\) mismatches

DOI10.1016/j.ipl.2020.106019zbMath1451.68220arXiv2002.11157OpenAlexW3048261206MaRDI QIDQ2203604

Dina Sokol

Publication date: 7 October 2020

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.11157

zbMATH Keywords

design of algorithmsHamming distancepalindrome2-dimensional

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient retrieval of approximate palindromes in a run-length encoded string
• Fast string matching with k differences
• Finding maximal 2-dimensional palindromes
• On-line construction of suffix trees
• On the maximum number of distinct palindromic sub-arrays
• Fast Algorithms for Finding Nearest Common Ancestors
• Finding All Approximate Gapped Palindromes
• Fast parallel and serial approximate string matching
• Approximate On-line Palindrome Recognition, and Applications
• Two-Dimensional Palindromes and Their Properties

This page was built for publication: 2-dimensional palindromes with \(k\) mismatches