Faster Algorithms for Computing Longest Common Increasing Subsequences

DOI10.1007/11780441_30zbMATH Open1196.68344OpenAlexW1504893030MaRDI QIDQ5307517

Gerth Stølting Brodal, Irit Katriel, Kanela Kaligosi, 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)

Related Items (8)

Computing a longest common subsequence that is almost increasing on sequences having no repeated elements ⋮ Unnamed Item ⋮ Near-optimal algorithm to count occurrences of subsequences of a given length ⋮ FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search ⋮ New efficient algorithms for the LCS and constrained LCS problems ⋮ Efficient algorithms for finding a longest common increasing subsequence ⋮ A new efficient algorithm for computing the longest common subsequence ⋮ A diagonal-based algorithm for the longest common increasing subsequence problem

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 👍 👎
• Fast computation of a longest increasing subsequence and application 👍 👎
• Computing the longest common almost-increasing subsequence 👍 👎
• An efficient algorithm for enumerating longest common increasing subsequences 👍 👎
• A New Efficient Algorithm for Computing the Longest Common Subsequence 👍 👎
• A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem. 👍 👎
• Algorithms and Computation 👍 👎
• A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem 👍 👎

This page was built for publication: Faster Algorithms for Computing Longest Common Increasing Subsequences