Mathematics – Combinatorics
Scientific paper
2006-11-22
Mathematics
Combinatorics
Scientific paper
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.
Bouvel Mathilde
Rossin Dominique
No associations
LandOfFree
Longest Common Pattern between two Permutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Longest Common Pattern between two Permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Longest Common Pattern between two Permutations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-368751