On the Set LCS and Set-Set LCS Problems

DOI10.1006/JAGM.1993.1025MaRDI QIDQ4696652zbMATH OpenOpenAlexFDO

Authors Biing-Feng Wang, Gen-Huey Chen, Kunsoo Park

Publication date 29 June 1993

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1993.1025

zbMATH Keywords

dynamic programminglongest common subsequence

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Dynamic programming (90C39)

Recommendations

• The set-set LCS problem
• The set LCS problem
• The longest common subsequence problem revisited
• Algorithms for Computing Variants of the Longest Common Subsequence Problem
• New algorithms for the LCS problem

Cited in

(7)

• The set LCS problem
• Matching for run-length encoded strings
• The set-set LCS problem
• The variant of remote set problem on lattices
• The set closest common subsequence problem
• Algorithms for two versions of LCS problem for indeterminate strings
• An improved algorithm for computing the edit distance of run-length coded strings

This page was built for publication: On the Set LCS and Set-Set LCS Problems

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