Pages that link to "Item:Q2032287"
From MaRDI portal
The following pages link to Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings (Q2032287):
Displaying 4 items.
- Minimal unique palindromic substrings after single-character substitution (Q2146122) (← links)
- Shortest unique palindromic substring queries in semi-dynamic settings (Q2169977) (← links)
- Palindromic trees for a sliding window and its applications (Q2234804) (← links)
- Data structures for computing unique palindromes in static and non-static strings (Q6119834) (← links)