Exemplar Longest Common Subsequence

DOI10.1007/11758525_85zbMath1155.68393OpenAlexW1754948582MaRDI QIDQ3545118

Stéphane Vialette, Riccardo Dondi, Guillaume Fertin, Gianluca Della Vedova, 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

Mathematics Subject Classification ID

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

Related Items (6)

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

This page was built for publication: Exemplar Longest Common Subsequence