Faster algorithms for computing longest common increasing subsequences
From MaRDI portal
Publication:655431
DOI10.1016/J.JDA.2011.03.013zbMATH Open1230.68225OpenAlexW2131441444MaRDI QIDQ655431FDOQ655431
Authors: Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kuetz 
Publication date: 4 January 2012
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2011.03.013
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
- The String-to-String Correction Problem
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Priority Search Trees
- A faster algorithm computing string edit distances
- A linear space algorithm for computing maximal common subsequences
- On computing the length of longest increasing subsequences
- Enumerating longest increasing subsequences and patience sorting
- A fast algorithm for computing longest common subsequences
- Design and implementation of an efficient priority queue
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- A fast algorithm for computing a longest common increasing subsequence
- A linear space algorithm for computing a longest common increasing subsequence
- Efficient algorithms for finding a longest common increasing subsequence
Cited In (29)
- Tight conditional lower bounds for longest common increasing subsequence
- Tight conditional lower bounds for longest common increasing subsequence
- Faster Algorithms for Computing Longest Common Increasing Subsequences
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
- An \(A^\ast\) search algorithm for the constrained longest common subsequence problem
- A fast algorithm for computing a longest common increasing subsequence
- A linear space algorithm for computing a longest common increasing subsequence
- A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem
- Computing and Combinatorics
- An efficient algorithm for the longest common palindromic subsequence problem
- Title not available (Why is that?)
- A cover-merging-based algorithm for the longest increasing subsequence in a sliding window problem
- Longest common rollercoasters
- Computing the longest common almost-increasing subsequence
- Longest increasing subsequences in windows based on canonical antichain partition
- Algorithms and Computation
- The longest commonly positioned increasing subsequences problem
- Computing a longest common almost-increasing subsequence of two sequences
- On two variants of the longest increasing subsequence problem
- On the longest increasing subsequence of a circular list
- Fast computation of a longest increasing subsequence and application
- Computing longest (common) Lyndon subsequences
- An efficient algorithm for enumerating longest common increasing subsequences
- Why is it hard to beat \(O(n^2)\) for longest common weakly increasing subsequence?
- Efficient algorithms for finding a longest common increasing subsequence
- A diagonal-based algorithm for the longest common increasing subsequence problem
- A linear algorithm for 3-letter longest common weakly increasing subsequence
- Computing longest Lyndon subsequences and longest common Lyndon subsequences
- Finding longest increasing and common subsequences in streaming data
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)
