Pages that link to "Item:Q845723"

The following pages link to A linear space algorithm for computing a longest common increasing subsequence (Q845723):

Displayed 4 items.

• Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635) ‎ (← links)
• On the limiting law of the length of the longest common and increasing subsequences in random words (Q529438) ‎ (← links)
• Faster algorithms for computing longest common increasing subsequences (Q655431) ‎ (← links)
• Why is it hard to beat \(O(n^2)\) for longest common weakly increasing subsequence? (Q1705641) ‎ (← links)