FINDING ALL APPROXIMATE GAPPED PALINDROMES

DOI10.1142/S0129054110007647zbMath1209.68399OpenAlexW2090534409MaRDI QIDQ3069733

Ping-Hui Hsu, Kuan-Yu Chen, Kun-Mao Chao

Publication date: 19 January 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054110007647

zbMATH Keywords

string matchingpalindromeincremental string comparison

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics on words (68R15)

Related Items

Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions ⋮ Efficient retrieval of approximate palindromes in a run-length encoded string ⋮ Computing Longest Single-arm-gapped Palindromes in a String ⋮ Palindromic Decompositions with Gaps and Errors

Cites Work

• Occurrences of palindromes in characteristic Sturmian words
• Palindrome positions in ternary square-free words
• Efficient algorithms to compute compressed longest common substrings and compressed palindromes
• Finding approximate palindromes in strings
• On-line construction of suffix trees
• An Improved Algorithm For Approximate String Matching
• Finding approximate patterns in strings
• Algorithms for approximate string matching
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Algorithms on Strings, Trees and Sequences
• Incremental String Comparison