Pages that link to "Item:Q2032287"

The following pages link to Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings (Q2032287):

Displaying 10 items.

• Algorithms and combinatorial properties on shortest unique palindromic substrings (Q1711666) (← links)
• 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)
• Shortest unique palindromic substring queries on run-length encoded strings (Q2301761) (← links)
• Shortest Unique Substring Queries on Run-Length Encoded Strings (Q4608632) (← links)
• Efficient Computation of Palindromes in Sequences with Uncertainties* (Q4611213) (← links)
• Faster queries for longest substring palindrome after block edit (Q5088918) (← links)
• Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. (Q5369553) (← links)
• Data structures for computing unique palindromes in static and non-static strings (Q6119834) (← links)