Variants of constrained longest common subsequence

We consider a variant of the classical Longest Common Subsequence problem called Doubly-Constrained Longest Common Subsequence (DC-LCS). Given two strings s"1 and s"2 over an alphabet @S, a set C"s of strings, and a function C"o:@S->N, the DC-LCS problem consists of finding the longest subsequence s of s"1 and s"2 such that s is a supersequence of all the strings in C"s and such that the number of occurrences in s of each symbol @[email protected][email protected] is upper bounded by C"o(@s). The DC-LCS problem provides a clear mathematical formulation of a sequence comparison problem in Computational Biology and generalizes two other constrained variants of the LCS problem that have been introduced previously in the literature: the Constrained LCS and the Repetition-Free LCS. We present two results for the DC-LCS problem. First, we illustrate a fixed-parameter algorithm where the parameter is the length of the solution which is also applicable to the more specialized problems. Second, we prove a parameterized hardness result for the Constrained LCS problem when the parameter is the number of the constraint strings (|C"s|) and the size of the alphabet @S. This hardness result also implies the parameterized hardness of the DC-LCS problem (with the same parameters) and its NP-hardness when the size of the alphabet is constant.

[1]  Alfredo De Santis,et al.  A simple algorithm for the constrained sequence problems , 2004, Information Processing Letters.

[2]  Krzysztof Pietrzak,et al.  On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems , 2003, J. Comput. Syst. Sci..

[3]  A. Gorbenko.  On the Constrained Longest Common Subsequence Problem , 2010 .

[4]  Tao Jiang,et al.  On the Approximation of Shortest Common Supersequences and Longest Common Subsequences , 1994, SIAM J. Comput..

[5]  Alberto Apostolico.  Improving the Worst-Case Performance of the Hunt-Szymanski Strategy for the Longest Common Subsequence of Two Strings , 1986, Inf. Process. Lett..

[6]  Tao Jiang,et al.  On the Approximation of Shortest Common Supersequences and Longest Common Subsequences , 1995, SIAM J. Comput..

[7]  Carlos Eduardo Ferreira,et al.  Repetition-free longest common subsequence , 2008, Electron. Notes Discret. Math..

[8]  Ömer Egecioglu,et al.  Dictionary Look-Up Within Small Edit Distance , 2004, Int. J. Found. Comput. Sci..

[9]  Mike Paterson,et al.  Longest Common Subsequences , 1994, MFCS.

[10]  L. Bergroth,et al.  A survey of longest common subsequence algorithms , 2000, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000.

[11]  Ömer Egecioglu,et al.  Dictionary Look-Up within Small Edit Distance , 2002, COCOON.

[12]  Alberto Apostolico,et al.  The longest common subsequence problem revisited , 1987, Algorithmica.

[13]  David Maier,et al.  The Complexity of Some Problems on Subsequences and Supersequences , 1978, JACM.

[14]  Esko Ukkonen,et al.  The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete , 1981, Theor. Comput. Sci..

[15]  Alberto Apostolico,et al.  Fast Linear-Space Computations of Longest Common Subsequences , 1992, Theor. Comput. Sci..

[16]  Jeanette P. Schmidt,et al.  The Spatial Complexity of Oblivious k-Probe Hash Functions , 2018, SIAM J. Comput..

[17]  P. Bonizzoni,et al.  Exemplar Longest Common Subsequence , 2006, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[18]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[19]  David Sankoff,et al.  Genome rearrangement with gene families , 1999, Bioinform..

[20]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[21]  Carlos Eduardo Ferreira,et al.  A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant , 2008, LATIN.

[22]  Mam Riess Jones.  Color Coding , 1962, Human factors.

[23]  Carlos Eduardo Ferreira,et al.  Repetition-free longest common subsequence , 2010, Discret. Appl. Math..

[24]  Moshe Lewenstein,et al.  Constrained LCS: Hardness and Approximation , 2008, CPM.