Longest Common Pattern between two Permutations
Combinatorics
2014-10-01 v1 Discrete Mathematics
Data Structures and Algorithms
Abstract
In this paper, we give a polynomial (O(n^8)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable. We also give an algorithm for general permutations whose complexity depends on the length of the longest simple permutation involved in one of our permutations.
Cite
@article{arxiv.math/0611679,
title = {Longest Common Pattern between two Permutations},
author = {Dominique Rossin and Mathilde Bouvel},
journal= {arXiv preprint arXiv:math/0611679},
year = {2014}
}