Longest Common Separable Pattern Among Permutations
From MaRDI portal
Publication:3506933
DOI10.1007/978-3-540-73437-6_32zbMath1138.68657OpenAlexW1565076675MaRDI QIDQ3506933
Stéphane Vialette, Mathilde Bouvel, Dominique Rossin
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
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorics on words (68R15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
A fast algorithm for permutation pattern matching based on alternating runs ⋮ Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings ⋮ A survey of the algorithmic aspects of modular decomposition
This page was built for publication: Longest Common Separable Pattern Among Permutations
