Pages that link to "Item:Q2227497"
From MaRDI portal
The following pages link to Computing longest palindromic substring after single-character or block-wise edits (Q2227497):
Displaying 6 items.
- Minimal unique palindromic substrings after single-character substitution (Q2146122) (← links)
- The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
- Shortest unique palindromic substring queries in semi-dynamic settings (Q2169977) (← links)
- Tight bound for the number of distinct palindromes in a tree (Q6042101) (← links)
- Finding top-\(k\) longest palindromes in substrings (Q6057835) (← links)
- Data structures for computing unique palindromes in static and non-static strings (Q6119834) (← links)