The following pages link to Algorithms and Computation (Q5897899):
Displaying 9 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)
- A linear space algorithm for computing a longest common increasing subsequence (Q845723) (← links)
- An algorithm for the determination of longest increasing subsequence in a sequence (Q1119638) (← links)
- Why is it hard to beat \(O(n^2)\) for longest common weakly increasing subsequence? (Q1705641) (← links)
- Efficient algorithms for the longest common subsequence in \(k\)-length substrings (Q2252645) (← links)
- A diagonal-based algorithm for the longest common increasing subsequence problem (Q2310745) (← links)
- (Q4739189) (← links)
- Faster Algorithms for Computing Longest Common Increasing Subsequences (Q5307517) (← links)
