Improved algorithms for the boxed-mesh permutation pattern matching problem

DOI10.1007/978-3-319-19929-0_12MaRDI QIDQ2942252zbMATH OpenOpenAlexFDO

Authors Sukhyeun Cho, Joong Chae Na, J. S. 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

boxed-mesh patternorder-isomorphismpermutation pattern matching

Mathematics Subject Classification ID

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

Recommendations

• An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem
• Boxed permutation pattern matching
• The computational landscape of permutation patterns
• Single and multiple consecutive permutation motif search
• A linear time algorithm for consecutive permutation pattern matching

Cites work

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

Cited in

(2)

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

This page was built for publication: Improved algorithms for the boxed-mesh permutation pattern matching problem

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