Longest Common Separable Pattern Among Permutations
- Cite this paper as:
- Bouvel M., Rossin D., Vialette S. (2007) Longest Common Separable Pattern Among Permutations. In: Ma B., Zhang K. (eds) Combinatorial Pattern Matching. CPM 2007. Lecture Notes in Computer Science, vol 4580. Springer, Berlin, Heidelberg
In this paper, we study the problem of finding the longest common separable pattern among several permutations. We first give a polynomial-time algorithm when the number of input permutations is fixed and next show that the problem is NP–hardfor an arbitrary number of input permutations even if these permutations are separable.
On the other hand, we show that the NP–hardproblem of finding the longest common pattern between two permutations cannot be approximated better than within a ratio of Open image in new window (where Open image in new window is the size of an optimal solution) when taking common patterns belonging to pattern-avoiding permutation classes.
Unable to display preview. Download preview PDF.