A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant
نویسندگان
چکیده
We consider the longest common subsequence problem (lcs) and a variant of it where each symbol may occur at most once in the common subsequence. The lcs is a well-known problem that can be solved in polynomial time by a dynamic programming algorithm. We provide a complete description of a polytope we associate with the lcs. The integrality of this polytope can be derived by showing that it is in fact the clique polytope of a perfect graph. The repetition-free version of the problem is known to be difficult. We also associate a polytope with this version and investigate its facial structure. We present some valid and facet-defining inequalities for this polytope and discuss separation procedures. Finally, we present some computational results of a branch and cut algorithm we have implemented for this problem.
منابع مشابه
Variants of Constrained Longest Common Subsequence
In this work, we consider a variant of the classical Longest Common Subsequence problem called Doubly-Constrained Longest Common Subsequence (DC-LCS). Given two strings s1 and s2 over an alphabet Σ, a set Cs of strings, and a function Co : Σ → N , the DC-LCS problem consists in finding the longest subsequence s of s1 and s2 such that s is a supersequence of all the strings in Cs and such that t...
متن کاملRepetition-free longest common subsequence of random sequences
A repetition free Longest Common Subsequence (LCS) of two sequences x and y is an LCS of x and y where each symbol may appear at most once. Let R denote the length of a repetition free LCS of two sequences of n symbols each one chosen randomly, uniformly, and independently over a k-ary alphabet. We study the asymptotic, in n and k, behavior of R and establish that there are three distinct regim...
متن کاملSome properties of a class of polyhedral semigroups based upon the subword reversing method
In this paper a certain class of polyhedral semigroups which has a presentation $$ is examined. The completeness of the presentation and solvability of word problem of this class of semigroups is determined. Moreover the combinatorial distance between two words is determined.
متن کاملNumerical investigation of free surface flood wave and solitary wave using incompressible SPH method
Simulation of free surface flow and sudden wave profile are recognized as the most challenging problem in computational hydraulics. Several Eulerian/Lagrangian approaches and models can be implemented for simulating such phenomena in which the smoothed particle hydrodynamics method (SPH) is categorized as a proper candidate. The incompressible SPH (ISPH) method hires a precise incompressible hy...
متن کاملRobust portfolio selection with polyhedral ambiguous inputs
Ambiguity in the inputs of the models is typical especially in portfolio selection problem where the true distribution of random variables is usually unknown. Here we use robust optimization approach to address the ambiguity in conditional-value-at-risk minimization model. We obtain explicit models of the robust conditional-value-at-risk minimization for polyhedral and correlated polyhedral am...
متن کامل