Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem

DOI10.1007/978-3-319-19929-0_12zbMath1380.68466OpenAlexW984661297MaRDI QIDQ2942252

Sukhyeun Cho, Joong Chae Na, Jeong Seop Sim

Publication date: 20 August 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-19929-0_12

zbMATH Keywords

permutation pattern matchingorder-isomorphismboxed-mesh pattern

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Algorithms on strings (68W32)

Related Items (1)

An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem

Cites Work

• Unnamed Item
• Pattern matching for permutations
• A linear time algorithm for consecutive permutation pattern matching
• A fast algorithm for order-preserving pattern matching
• Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
• Consecutive patterns in permutations
• Avoidance of boxed mesh patterns on permutations
• Order-preserving matching
• The computational landscape of permutation patterns

This page was built for publication: Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem