FINDING ALL APPROXIMATE GAPPED PALINDROMES
From MaRDI portal
Publication:3069733
Recommendations
- Finding all approximate gapped palindromes
- Searching for gapped palindromes
- Searching for Gapped Palindromes
- Finding approximate palindromes in strings
- Finding gapped palindromes online
- scientific article; zbMATH DE number 7696009
- Finding palindromes: variants and algorithms
- Identifying approximate palindromes in run-length encoded strings
- Computing longest single-arm-gapped palindromes in a string
- Greedy palindromic lengths
Cites work
- Algorithms for approximate string matching
- Algorithms on Strings, Trees and Sequences
- An Improved Algorithm For Approximate String Matching
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
- Finding approximate palindromes in strings
- Finding approximate patterns in strings
- Incremental String Comparison
- Occurrences of palindromes in characteristic Sturmian words
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- On-line construction of suffix trees
- Palindrome positions in ternary square-free words
Cited in
(7)- Efficient retrieval of approximate palindromes in a run-length encoded string
- scientific article; zbMATH DE number 7696009 (Why is no real title available?)
- Computing longest single-arm-gapped palindromes in a string
- Finding approximate palindromes in strings
- Finding all approximate gapped palindromes
- Palindromic decompositions with gaps and errors
- Dynamic RLE-compressed edit distance tables under general weighted cost functions
This page was built for publication: FINDING ALL APPROXIMATE GAPPED PALINDROMES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3069733)
