Exemplar Longest Common Subsequence - Archive ouverte HAL Access content directly
Journal Articles ACM Transactions on Computational Logic Year : 2007

Exemplar Longest Common Subsequence


In this 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, we first present an efficient algorithm for the ELCS problem over instances of two sequences where each mandatory symbol can appear in total at most three times in the sequences. Furthermore, we present two fixed parameter algorithms for the ELCS problem over instances of two sequences where the parameter is the number of mandatory symbols.
Fichier principal
Vignette du fichier
ExemplarLCSTCBB.pdf (145.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00417728 , version 1 (16-09-2009)


  • HAL Id : hal-00417728 , version 1


Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Rafaella Rizzi, et al.. Exemplar Longest Common Subsequence. ACM Transactions on Computational Logic, 2007, 4 (4), pp.535-543. ⟨hal-00417728⟩
380 View
346 Download


Gmail Facebook Twitter LinkedIn More