A fast algorithm of constrained longest common subsequence

MaRDI QIDQ3051687zbMATH OpenFDO

Authors Ning Ye, Daming Zhu, Qianqian Zhang, Lirong Shen

Publication date 5 November 2010

zbMATH Keywords

fast algorithmprimal-dual algorithmconstrained longest common subsequence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Recommendations

• A simple algorithm for the constrained sequence problems
• scientific article; zbMATH DE number 6697960
• New efficient algorithms for the LCS and constrained LCS problems
• ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS
• An \(A^\ast\) search algorithm for the constrained longest common subsequence problem

Cited in

(11)

• scientific article; zbMATH DE number 6697960 (Why is no real title available?)
• An \(A^\ast\) search algorithm for the constrained longest common subsequence problem
• Fast algorithms for computing the constrained LCS of run-length encoded strings
• A geometric framework for solving subsequence problems in computational biology efficiently
• Variants of constrained longest common subsequence
• A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings
• Efficient algorithms for the longest common subsequence problem with sequential substring constraints
• Bit-parallel algorithm for the constrained longest common subsequence problem
• The Constrained Longest Common Subsequence Problem for Degenerate Strings
• A simple algorithm for the constrained sequence problems
• Constrained sequence analysis algorithms in computational biology

This page was built for publication: A fast algorithm of constrained longest common subsequence

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