On the Approximation of Shortest Common Supersequencesand Longest Common Subsequences
SIAM Journal on Computing
The String-to-String Correction Problem
Journal of the ACM (JACM)
The Complexity of Some Problems on Subsequences and Supersequences
Journal of the ACM (JACM)
Some APX-completeness results for cubic graphs
Theoretical Computer Science
Introduction to Algorithms
The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings
ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
On the similarity of sets of permutations and its applications to genome comparison
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Power boosts for cluster tests
RCG'05 Proceedings of the 2005 international conference on Comparative Genomics
Conserved interval distance computation between non-trivial genomes
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Genomes containing duplicates are hard to compare
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Variants of constrained longest common subsequence
Information Processing Letters
The zero exemplar distance problem
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
On the generalized constrained longest common subsequence problems
Journal of Combinatorial Optimization
On the parameterized complexity of the repetition free longest common subsequence problem
Information Processing Letters
Doubly-Constrained LCS and Hybrid-Constrained LCS problems revisited
Information Processing Letters
Inapproximability of (1,2)-exemplar distance
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
The constrained shortest common supersequence problem
Journal of Discrete Algorithms
Inapproximability of (1,2)-Exemplar Distance
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An Exact Algorithm for the Zero Exemplar Breakpoint Distance Problem
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |
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.