Faster algorithms for computing longest common increasing subsequences
From MaRDI portal
Recommendations
- Faster Algorithms for Computing Longest Common Increasing Subsequences
- Algorithms and Computation
- Efficient algorithms for finding a longest common increasing subsequence
- A fast algorithm for computing a longest common increasing subsequence
- A diagonal-based algorithm for the longest common increasing subsequence problem
Cites work
- A fast algorithm for computing a longest common increasing subsequence
- A fast algorithm for computing longest common subsequences
- A faster algorithm computing string edit distances
- A linear space algorithm for computing a longest common increasing subsequence
- A linear space algorithm for computing maximal common subsequences
- Design and implementation of an efficient priority queue
- Efficient algorithms for finding a longest common increasing subsequence
- Enumerating longest increasing subsequences and patience sorting
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- On computing the length of longest increasing subsequences
- Priority Search Trees
- The String-to-String Correction Problem
Cited in
(31)- The longest commonly positioned increasing subsequences problem
- Why is it hard to beat \(O(n^2)\) for longest common weakly increasing subsequence?
- A linear algorithm for 3-letter longest common weakly increasing subsequence
- Fast computation of a longest increasing subsequence and application
- Longest common rollercoasters
- Computing the longest common almost-increasing subsequence
- Computing longest (common) Lyndon subsequences
- Computing a longest common almost-increasing subsequence of two sequences
- An \(A^\ast\) search algorithm for the constrained longest common subsequence problem
- Tight conditional lower bounds for longest common increasing subsequence
- A diagonal-based algorithm for the longest common increasing subsequence problem
- Longest increasing subsequences in windows based on canonical antichain partition
- Finding longest increasing and common subsequences in streaming data
- An efficient algorithm for the longest common palindromic subsequence problem
- An efficient algorithm for enumerating longest common increasing subsequences
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
- A cover-merging-based algorithm for the longest increasing subsequence in a sliding window problem
- Sketching, streaming, and fine-grained complexity of (weighted) LCS
- Tight conditional lower bounds for longest common increasing subsequence
- On two variants of the longest increasing subsequence problem
- Faster Algorithms for Computing Longest Common Increasing Subsequences
- Computing and Combinatorics
- Algorithms and Computation
- A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem
- Computing longest Lyndon subsequences and longest common Lyndon subsequences
- A space-efficient algorithm for longest common almost increasing subsequence of two sequences
- The merged longest common increasing subsequence problem
- A fast algorithm for computing a longest common increasing subsequence
- A linear space algorithm for computing a longest common increasing subsequence
- On the longest increasing subsequence of a circular list
- Efficient algorithms for finding a longest common increasing subsequence
This page was built for publication: Faster algorithms for computing longest common increasing subsequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q655431)
