The set closest common subsequence problem

MaRDI QIDQ2765656zbMATH OpenFDO

Authors Gabriela Andrejková

Publication date 24 January 2002

zbMATH Keywords

common subsequence problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The set-set LCS problem
• The set LCS problem
• On the Set LCS and Set-Set LCS Problems
• The constrained longest common subsequence problem
• Maximal common subsequence algorithms

Cited in

(5)

• The set LCS problem
• The shortest common nonsubsequence problem is NP-complete
• The set-set LCS problem
• A practical algorithm to find the best subsequence patterns
• The similarity of two strings of fuzzy sets.

This page was built for publication: The set closest common subsequence problem

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