An O(n^2 m)-time algorithm for the boxed-mesh permutation pattern matching problem
From MaRDI portal
(Redirected from Publication:1698703)
An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem
An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem
Recommendations
- Improved algorithms for the boxed-mesh permutation pattern matching problem
- Boxed permutation pattern matching
- A linear time algorithm for consecutive permutation pattern matching
- Finding pattern matchings for permutations
- Sub-quadratic time and linear space data structures for permutation matching in binary strings
Cites work
- scientific article; zbMATH DE number 6297698 (Why is no real title available?)
- A fast algorithm for order-preserving pattern matching
- A linear time algorithm for consecutive permutation pattern matching
- Avoidance of boxed mesh patterns on permutations
- Boxed permutation pattern matching
- Consecutive patterns in permutations
- Improved algorithms for the boxed-mesh permutation pattern matching problem
- 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)
This page was built for publication: An \(O(n^2\log m)\)-time algorithm 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 Q1698703)