Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs

For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisation, called "the all semi-local LCS problem", for which we proposed an efficient output representation and an efficient algorithm. In this paper, we consider a restriction of this problem to strings that are permutations of a given set. The resulting problem is equivalent to the all local longest increasing subsequences (LIS) problem. We propose an algorithm for this problem,

• Type: Conference
• Year: 2006
• Where: CPM
• Authors: Alexandre Tiskin
• Keywords: Combinatorics, CPM 2006, Efficient Output Representation, Longest Common Subsequence, Semi-local Lcs Problem