An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem
type: Item
instance of: scholarly article
title: An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem
zbMATH Open document ID: 1386.68233
author: Sukhyeun Cho
author: Joong Chae Na
author: J. S. Sim
published in: Theoretical Computer Science
publication date: 2018-02-16T00:00:00Z
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 6839795
zbMATH Keywords: permutation pattern matching
zbMATH Keywords: order-isomorphism
zbMATH Keywords: boxed-mesh pattern
MaRDI profile type: Publication
full work available at URL: j.tcs.2017.02.022
OpenAlex ID: W2593271174
cites work: Boxed Permutation Pattern Matching.
cites work: Avoidance of boxed mesh patterns on permutations
cites work: Pattern matching for permutations
cites work: Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
cites work: The computational landscape of permutation patterns
cites work: Q5417615
cites work: A fast algorithm for order-preserving pattern matching
cites work: Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem
cites work: Q3651735
cites work: Consecutive patterns in permutations
cites work: Order-preserving matching
cites work: A linear time algorithm for consecutive permutation pattern matching
DOI: 10.1016/J.TCS.2017.02.022
description: scientific article; zbMATH DE number 6839795