Faster Algorithms for Computing Longest Common Increasing Subsequences

DOI10.1007/11780441_30MaRDI QIDQ5307517zbMATH OpenOpenAlexFDO

Authors Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kuetz

Publication date 14 September 2007

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11780441_30

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Recommendations

• Faster algorithms for computing longest common increasing subsequences
• A fast algorithm for computing a longest common increasing subsequence
• Efficient algorithms for finding a longest common increasing subsequence
• Algorithms and Computation
• A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem
• Fast computation of a longest increasing subsequence and application
• An efficient algorithm for enumerating longest common increasing subsequences
• Computing the longest common almost-increasing subsequence
• A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem.
• A New Efficient Algorithm for Computing the Longest Common Subsequence

Cited in

(18)

• 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
• A new efficient algorithm for computing the longest common subsequence
• A fast algorithm for computing a longest common increasing subsequence
• A linear space algorithm for computing a longest common increasing subsequence
• New efficient algorithms for the LCS and constrained LCS problems
• The merged longest common increasing subsequence problem
• Algorithms and Computation
• Computing a longest common almost-increasing subsequence of two sequences
• Fast computation of a longest increasing subsequence and application
• Faster algorithms for computing longest common increasing subsequences
• FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search
• 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
• scientific article; zbMATH DE number 2088088 (Why is no real title available?)

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 Q5307517)