Finding All Approximate Gapped Palindromes
From MaRDI portal
Publication:3652294
DOI10.1007/978-3-642-10631-6_109zbMath1273.68423OpenAlexW1535018767MaRDI QIDQ3652294
Ping-Hui Hsu, Kun-Mao Chao, Kuan-Yu Chen
Publication date: 17 December 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_109
Related Items (7)
Palindromic subsequence automata and longest common palindromic subsequence ⋮ Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance ⋮ Palindrome pattern matching ⋮ 2-dimensional palindromes with \(k\) mismatches ⋮ Palindromic Decompositions with Gaps and Errors ⋮ Finding maximal 2-dimensional palindromes ⋮ Palindrome Pattern Matching
This page was built for publication: Finding All Approximate Gapped Palindromes