Pages that link to "Item:Q835045"
From MaRDI portal
The following pages link to A fast algorithm for computing a longest common increasing subsequence (Q835045):
Displaying 29 items.
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635) (← links)
- Faster algorithms for computing longest common increasing subsequences (Q655431) (← links)
- A linear space algorithm for computing a longest common increasing subsequence (Q845723) (← links)
- Efficient algorithms for finding a longest common increasing subsequence (Q996830) (← 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)
- A linear algorithm for 3-letter longest common weakly increasing subsequence (Q1943622) (← links)
- FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search (Q1954643) (← links)
- Fast computation of a longest increasing subsequence and application (Q1959440) (← links)
- Longest common rollercoasters (Q2146120) (← links)
- Computing the longest common almost-increasing subsequence (Q2166775) (← links)
- Computing a longest common almost-increasing subsequence of two sequences (Q2220858) (← 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)
- Anytime algorithms for the longest common palindromic subsequence problem (Q2337390) (← links)
- Efficient algorithms for finding interleaving relationship between sequences (Q2380070) (← links)
- A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem (Q2444738) (← links)
- An efficient algorithm for the longest common palindromic subsequence problem (Q2672607) (← links)
- An efficient algorithm for enumerating longest common increasing subsequences (Q2695270) (← links)
- A CGM Algorithm Solving the Longest Increasing Subsequence Problem (Q3603018) (← links)
- (Q3621522) (← links)
- (Q5090981) (← links)
- (Q5111874) (← links)
- BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM (Q5168418) (← links)
- Faster Algorithms for Computing Longest Common Increasing Subsequences (Q5307517) (← links)
- Near-optimal algorithm to count occurrences of subsequences of a given length (Q5367537) (← links)
- Longest increasing subsequence under persistent comparison errors (Q5916089) (← links)
- A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem (Q6065393) (← links)
