Exemplar Longest Common Subsequence (extended abstract)

Abstract : In the paper we investigate the computational and approximation complexity of the Exemplar Longest Common Subsequence of a set of sequences (ELCS problem), a generalization of the Longest Common Subsequence problem, where the input sequences are over the union of two disjoint sets of symbols, a set of mandatory symbols and a set of optional symbols. We show that different versions of the problem are APX-hard even for instances with two sequences. Moreover, we show that the related problem of determining the existence of a feasible solution of the Exemplar Longest Common Subsequence of two sequences is NP-hard. On the positive side, efficient algorithms for the ELCS problem over instances of two sequences where each mandatory symbol can appear totally at most three times or the number of mandatory symbols is bounded by a constant are given.
Liste complète des métadonnées

Cited literature [7 references]  Display  Hide  Download

Contributor : Guillaume Fertin <>
Submitted on : Friday, March 5, 2010 - 5:15:35 PM
Last modification on : Thursday, February 7, 2019 - 4:31:44 PM
Document(s) archivé(s) le : Friday, June 18, 2010 - 10:22:42 PM


Files produced by the author(s)


  • HAL Id : hal-00461780, version 1


Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette. Exemplar Longest Common Subsequence (extended abstract). International Workshop on Bioinformatics Research and Applications (IWBRA 2006), May 2006, Reading, United Kingdom. pp.622-629. ⟨hal-00461780⟩



Record views


Files downloads