Efficient algorithms for finding a longest common increasing subsequence

DOI10.1007/S10878-006-9031-7zbMATH Open1123.68135OpenAlexW2078864816MaRDI QIDQ996830FDOQ996830

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

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

Cites Work

• Title not available (Why is that?)
• Longest Increasing and Decreasing Subsequences
• Adding range restriction capability to dynamic data structures
• A faster algorithm computing string edit distances
• Enumerating longest increasing subsequences and patience sorting
• 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
• A fast algorithm for computing a longest common increasing subsequence

Cited In (14)

• Tight conditional lower bounds for longest common increasing subsequence
• Faster Algorithms for Computing Longest Common Increasing Subsequences
• Title not available (Why is that?)
• Longest common rollercoasters
• Efficient algorithms for the longest common subsequence in \(k\)-length substrings
• An algorithm for the determination of longest increasing subsequence in a sequence
• Title not available (Why is that?)
• The longest commonly positioned increasing subsequences problem
• Simon's congruence pattern matching
• Faster algorithms for computing longest common increasing 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?
• A diagonal-based algorithm for the longest common increasing subsequence problem
• Title not available (Why is that?)

Uses Software

• MUMMER

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q996830)