Article Dans Une Revue Pure mathematics and applications Année : 2006

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.

Fichier principal
Vignette du fichier
LCPForPermutations.pdf (185.39 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-00115598 , version 1 (22-11-2006)

Licence

Identifiants

Citer

Dominique Rossin, Mathilde Bouvel. The Longest Common Pattern Problem for two Permutations. Pure mathematics and applications , 2006, 17 (1-2), pp.55-69. ⟨hal-00115598⟩
214 Consultations
339 Téléchargements

Altmetric

Partager

  • More