A linear space algorithm for the heaviest common subsequence problem

MaRDI QIDQ3512800zbMATH OpenFDO

Authors Rao Li

Publication date 21 July 2008

zbMATH Keywords

longest common subsequence

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• An algorithm for the constrained heaviest common subsequence problem
• Weighted LCS (extended abstract)
• Maximal common subsequence algorithms
• Maximal common subsequence algorithms
• Weighted LCS

Cited in

(5)

• A linear space algorithm for the LCS problem
• An algorithm for the constrained heaviest common subsequence problem
• Combinatorial Pattern Matching
• Weighted LCS
• Weighted LCS (extended abstract)

This page was built for publication: A linear space algorithm for the heaviest common subsequence problem

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