Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

CORR
2006
Springer

favoriteEmaildiscussreport

87views Education» more CORR 2006»

Longest Common Pattern between two Permutations

13 years 4 months ago

Longest Common Pattern between two Permutations

Download www.mat.unisi.it

In this paper, we give a polynomial (O(n8)) 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. Mathematics Subject Classifications (2000). 05A05, 05C12, 05C85, 05C05, 90C39

Dominique Rossin, Mathilde Bouvel

Real-time Traffic

CORR 2006 | Education | Longest Common Pattern | Longest Simple Permutation | Permutations |

claim paper

Related Content

» Longest Common Separable Pattern between Permutations

» Longest Common Separable Pattern Among Permutations

» Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs

» Finding Longest Increasing and Common Subsequences in Streaming Data

» Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences

» A bijection between permutations and floorplans and its applications

» On uniquely kdetermined permutations

» Pattern classes of permutations via bijections between linearly ordered sets

» The Greedy Algorithm for the Minimum Common String Partition Problem

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CORR
Authors	Dominique Rossin, Mathilde Bouvel

Comments (0)