Computing the longest common almost-increasing subsequence
From MaRDI portal
Publication:2166775
Recommendations
- Computing a longest common almost-increasing subsequence of two sequences
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
- Faster algorithms for computing longest common increasing subsequences
- A fast algorithm for computing a longest common increasing subsequence
- Faster Algorithms for Computing Longest Common Increasing Subsequences
Cites work
- A fast algorithm for computing a longest common increasing subsequence
- A new efficient algorithm for computing the longest common subsequence
- Algorithms for Computing the Longest Parameterized Common Subsequence
- Algorithms for computing variants of the longest common subsequence problem
- Computing a longest common almost-increasing subsequence of two sequences
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
- Computing and Combinatorics
- Data streams: algorithms and applications.
- Design and implementation of an efficient priority queue
- Fast and deterministic constant factor approximation algorithms for LCS imply new circuit lower bounds
- Faster algorithms for computing longest common increasing subsequences
- Finite automata based algorithms on subsequences and supersequences of degenerate strings
- Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds
- Introduction to algorithms.
- Longest Increasing and Decreasing Subsequences
- Multivariate fine-grained complexity of longest common subsequence
- New efficient algorithms for the LCS and constrained LCS problems
- On computing the length of longest increasing subsequences
- On the generalized constrained longest common subsequence problems
- Permutations, matrices, and generalized Young tableaux
- Priority Search Trees
- The constrained longest common subsequence problem
- The Constrained Longest Common Subsequence Problem for Degenerate Strings
- The Longest Almost-Increasing Subsequence
- Tight conditional lower bounds for longest common increasing subsequence
Cited in
(10)- An algorithm for the determination of longest increasing subsequence in a sequence
- Why is it hard to beat \(O(n^2)\) for longest common weakly increasing subsequence?
- A diagonal-based algorithm for the longest common increasing subsequence problem
- Computing the least common subsumer w.r.t. a background terminology
- Computing a Longest Common Palindromic Subsequence
- A CGM Algorithm Solving the Longest Increasing Subsequence Problem
- Faster Algorithms for Computing Longest Common Increasing Subsequences
- Algorithms and hardness for the longest common subsequence of three strings and related problems
- The longest almost increasing subsequence problem with sliding windows
- A space-efficient algorithm for longest common almost increasing subsequence of two sequences
This page was built for publication: Computing the longest common almost-increasing subsequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2166775)
