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

DOI10.1016/j.tcs.2017.02.022zbMath1386.68233OpenAlexW2593271174MaRDI QIDQ1698703

Joong Chae Na, Sukhyeun Cho, Jeong Seop Sim

Publication date: 16 February 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.02.022

zbMATH Keywords

permutation pattern matchingorder-isomorphismboxed-mesh pattern

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• 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
• Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem
• Boxed Permutation Pattern Matching.

This page was built for publication: An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem