A fast algorithm for computing a longest common increasing subsequence
From MaRDI portal
Recommendations
- A linear space algorithm for computing a longest common increasing subsequence
- Faster algorithms for computing longest common increasing subsequences
- Faster Algorithms for Computing Longest Common Increasing Subsequences
- Algorithms and Computation
- Efficient algorithms for finding a longest common increasing subsequence
Cites work
- scientific article; zbMATH DE number 42967 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- A fast algorithm for computing longest common subsequences
- A faster algorithm computing string edit distances
- Enumerating longest increasing subsequences and patience sorting
- Good splitters for counting points in triangles
- Longest Increasing and Decreasing Subsequences
- On computing the length of longest increasing subsequences
Cited in
(30)- Near-optimal algorithm to count occurrences of subsequences of a given length
- Tight conditional lower bounds for longest common increasing subsequence
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
- Tight conditional lower bounds for longest common increasing subsequence
- Faster Algorithms for Computing Longest Common Increasing Subsequences
- A linear space algorithm for computing a longest common increasing subsequence
- A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem
- An efficient algorithm for the longest common palindromic subsequence problem
- scientific article; zbMATH DE number 7561345 (Why is no real title available?)
- scientific article; zbMATH DE number 3860389 (Why is no real title available?)
- A CGM Algorithm Solving the Longest Increasing Subsequence Problem
- scientific article; zbMATH DE number 5545474 (Why is no real title available?)
- Longest common rollercoasters
- A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem
- An algorithm for the determination of longest increasing subsequence in a sequence
- Computing the longest common almost-increasing subsequence
- Algorithms and Computation
- Anytime algorithms for the longest common palindromic subsequence problem
- The longest commonly positioned increasing subsequences problem
- Computing a longest common almost-increasing subsequence of two sequences
- Fast computation of a longest increasing subsequence and application
- Bit-parallel algorithms for the merged longest common subsequence problem
- Faster algorithms for computing longest common increasing subsequences
- FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search
- Why is it hard to beat \(O(n^2)\) for longest common weakly increasing subsequence?
- An efficient algorithm for enumerating longest common increasing subsequences
- Efficient algorithms for finding a longest common increasing subsequence
- A diagonal-based algorithm for the longest common increasing subsequence problem
- Efficient algorithms for finding interleaving relationship between sequences
- A linear algorithm for 3-letter longest common weakly increasing subsequence
This page was built for publication: A fast algorithm for computing a longest common increasing subsequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835045)
