Pages that link to "Item:Q996830"
From MaRDI portal
The following pages link to Efficient algorithms for finding a longest common increasing subsequence (Q996830):
Displaying 19 items.
- Faster algorithms for computing longest common increasing subsequences (Q655431) (← links)
- A fast algorithm for computing a longest common increasing subsequence (Q835045) (← links)
- An algorithm for the determination of longest increasing subsequence in a sequence (Q1119638) (← links)
- The longest commonly positioned increasing subsequences problem (Q1702817) (← links)
- Why is it hard to beat \(O(n^2)\) for longest common weakly increasing subsequence? (Q1705641) (← links)
- Finding the longest common sub-pattern in sequences of temporal intervals (Q1715886) (← links)
- A linear algorithm for 3-letter longest common weakly increasing subsequence (Q1943622) (← links)
- Fast computation of a longest increasing subsequence and application (Q1959440) (← links)
- Longest common rollercoasters (Q2146120) (← links)
- Efficient algorithms for the longest common subsequence in \(k\)-length substrings (Q2252645) (← links)
- Tight conditional lower bounds for longest common increasing subsequence (Q2272597) (← links)
- A diagonal-based algorithm for the longest common increasing subsequence problem (Q2310745) (← links)
- Efficient algorithms for finding interleaving relationship between sequences (Q2380070) (← links)
- An efficient algorithm for enumerating longest common increasing subsequences (Q2695270) (← links)
- (Q4739189) (← links)
- (Q5090981) (← links)
- (Q5111874) (← links)
- Faster Algorithms for Computing Longest Common Increasing Subsequences (Q5307517) (← links)
- Simon's congruence pattern matching (Q6204538) (← links)
