Exemplar Longest Common Subsequence

DOI10.1007/11758525_85zbMATH Open1155.68393OpenAlexW1754948582MaRDI QIDQ3545118FDOQ3545118

Authors: Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette, Paola Bonizzoni 

Publication date: 9 December 2008

Published in: Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11758525_85

Recommendations

• Algorithms for Computing Variants of the Longest Common Subsequence Problem
• Hardness of longest common subsequence for sequences with bounded run-lengths
• Constrained LCS: Hardness and Approximation
• On the generalized constrained longest common subsequence problems
• Variants of constrained longest common subsequence

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (6)

• A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant
• Repetition-free longest common subsequence
• Doubly-constrained LCS and hybrid-constrained LCS problems revisited
• On the generalized constrained longest common subsequence problems
• Repetition-free longest common subsequence
• Theoretical lower bound for border length minimization problem

This page was built for publication: Exemplar Longest Common Subsequence

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