Efficient algorithms for finding a longest common increasing subsequence

DOI10.1007/s10878-006-9031-7zbMath1123.68135OpenAlexW2078864816MaRDI QIDQ996830

Yong Zhang, Hong Zhu, Deshi Ye, Wun-Tat Chan, Stanley P. Y. Fung

Publication date: 19 July 2007

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-006-9031-7

zbMATH Keywords

Design and analysis of algorithmsLongest common increasing subsequence

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20)

Related Items (9)

Longest common rollercoasters ⋮ Simon's congruence pattern matching ⋮ The longest commonly positioned increasing subsequences problem ⋮ An efficient algorithm for enumerating longest common increasing subsequences ⋮ Faster algorithms for computing longest common increasing subsequences ⋮ Tight conditional lower bounds for longest common increasing subsequence ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A diagonal-based algorithm for the longest common increasing subsequence problem

Uses Software

• MUMMER

Cites Work

• Unnamed Item
• Enumerating longest increasing subsequences and patience sorting
• A fast algorithm for computing a longest common increasing subsequence
• A faster algorithm computing string edit distances
• Longest Increasing and Decreasing Subsequences
• Adding range restriction capability to dynamic data structures
• A fast algorithm for computing longest common subsequences
• The Complexity of Some Problems on Subsequences and Supersequences
• Faster Algorithms for Computing Longest Common Increasing Subsequences

This page was built for publication: Efficient algorithms for finding a longest common increasing subsequence