The Longest Common Pattern Problem for two Permutations
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|---|
| Licence |
Loading...