Longest substring palindrome after edit
From MaRDI portal
Recommendations
- Computing longest palindromic substring after single-character or block-wise edits
- Longest Lyndon Substring After Edit
- Faster queries for longest substring palindrome after block edit
- On finding a longest common palindromic subsequence
- Minimal unique palindromic substrings after single-character substitution
- Computing a longest common palindromic subsequence
- Computing a Longest Common Palindromic Subsequence
- Counting palindromes in substrings
- Longest -gapped repeat and palindrome
Cites work
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- Algorithms on Strings, Trees and Sequences
- Computing longest single-arm-gapped palindromes in a string
- Counting distinct palindromes in a word in linear time
- Dynamic LCA Queries on Trees
- Efficient algorithms for Lempel-Ziv encoding
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
- Fast Algorithms for Finding Nearest Common Ancestors
- Finding approximate palindromes in strings
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- Longest common factor after one edit operation
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- On the sorting-complexity of suffix tree construction
- On-line construction of suffix trees
- Parallel detection of all palindromes in a string
- Searching for gapped palindromes
- Tighter bounds and optimal algorithms for all maximal -gapped repeats and palindromes. Finding all maximal -gapped repeats and palindromes in optimal worst case time on integer alphabets
Cited in
(11)- The heaviest induced ancestors problem: better data structures and applications
- Dynamic and internal longest common substring
- Computing longest palindromic substring after single-character or block-wise edits
- Longest property-preserved common factor: a new string-processing framework
- Repetition Detection in a Dynamic String
- Longest common substring made fully dynamic
- Bidirectional Text Compression in External Memory
- Faster queries for longest substring palindrome after block edit
- Longest Lyndon Substring After Edit
- Longest common factor after one edit operation
- A textbook solution for dynamic strings
This page was built for publication: Longest substring palindrome after edit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140775)
