The longest common pattern problem for two permutations

MaRDI QIDQ3077256zbMATH OpenFDO

Authors Mathilde Bouvel, Dominique Rossin

Publication date 22 February 2011

zbMATH Keywords

longest common pattern problem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Distance in graphs (05C12)

Recommendations

• Longest Common Separable Pattern Among Permutations
• Pattern matching for separable permutations
• Pattern matching for permutations
• Pattern matching for permutations
• On the longest common pattern contained in two or more random permutations

Cited in

(8)

• Random assignments on sequentially dichotomous domains
• Longest Common Separable Pattern Among Permutations
• Constructing separable Arnold snakes of Morse polynomials
• A survey of the algorithmic aspects of modular decomposition
• Pattern matching for separable permutations
• On the longest common pattern contained in two or more random permutations
• Unknotted cycles
• An algorithm computing combinatorial specifications of permutation classes

This page was built for publication: The longest common pattern problem for two permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3077256)