Longest Common Separable Pattern Among Permutations

DOI10.1007/978-3-540-73437-6_32MaRDI QIDQ3506933zbMATH OpenOpenAlexFDO

Authors Mathilde Bouvel, Dominique Rossin, Stéphane Vialette

Publication date 17 June 2008

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73437-6_32

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Nonnumerical algorithms (68W05)

Recommendations

• The longest common pattern problem for two permutations
• Pattern matching for permutations
• Pattern matching for permutations
• Pattern matching for separable permutations
• Finding pattern matchings for permutations

Cited in

(5)

• Longest common subsequence in at least k length order-isomorphic substrings
• The longest common pattern problem for two permutations
• Permuted Longest-Common-Prefix Array
• A survey of the algorithmic aspects of modular decomposition
• Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs

This page was built for publication: Longest Common Separable Pattern Among Permutations

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