Pattern matching for separable permutations

DOI10.1007/978-3-319-46049-9_25MaRDI QIDQ1796851zbMATH OpenOpenAlexFDO

Authors Both Emerite Neou, Romeo Rizzi, Stéphane Vialette

Publication date 17 October 2018

Full work available at URL https://hal-upec-upem.archives-ouvertes.fr/hal-01798554/file/Spire-2016.pdf

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Finding pattern matchings for permutations
• Pattern matching for permutations
• Pattern matching for permutations
• scientific article; zbMATH DE number 2081004
• The longest common pattern problem for two permutations

Cited in

(14)

• Longest Common Separable Pattern Among Permutations
• Distributions of statistics on separable permutations
• Permutation pattern matching in \((213,231)\)-avoiding permutations
• Finding pattern matchings for permutations
• Pattern matching for permutations
• k-Abelian Pattern Matching
• Pattern matching for permutations
• scientific article; zbMATH DE number 2081004 (Why is no real title available?)
• Detection of the permutation symmetry in pattern sets
• Parity permutation pattern matching
• \(k\)-abelian pattern matching
• Recognizing binary shuffle squares is \textsf{NP}-hard
• The longest common pattern problem for two permutations
• Pattern matching in the cycle structures of permutations

This page was built for publication: Pattern matching for separable permutations

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