Pages that link to "Item:Q2337390"
From MaRDI portal
The following pages link to Anytime algorithms for the longest common palindromic subsequence problem (Q2337390):
Displaying 4 items.
- A beam search for the shortest common supersequence problem guided by an approximate expected length calculation (Q2163793) (← links)
- A hardness result and new algorithm for the longest common palindromic subsequence problem (Q2410574) (← links)
- Computing a Longest Common Palindromic Subsequence (Q2876577) (← links)
- Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. (Q5369553) (← links)