A fast algorithm for order-preserving pattern matching
From MaRDI portal
Publication:477704
DOI10.1016/J.IPL.2014.10.018zbMATH Open1302.68337OpenAlexW2077578233MaRDI QIDQ477704FDOQ477704
J. S. Sim, Kunsoo Park, Sukhyeun Cho, Joong Chae Na
Publication date: 9 December 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2014.10.018
Recommendations
analysis of algorithmsorder-preserving pattern matchingHorspool algorithmKMP algorithmorder-isomorphism
Cites Work
- Introduction to algorithms.
- Title not available (Why is that?)
- A fast string searching algorithm
- Order-preserving matching
- Fast Order-Preserving Pattern Matching
- A linear time algorithm for consecutive permutation pattern matching
- Linear-Time Ranking of Permutations
- A simple fast hybrid pattern-matching algorithm
Cited In (20)
- Order-preserving pattern matching indeterminate strings
- Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem
- String Periods in the Order-Preserving Model
- Title not available (Why is that?)
- Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching
- An Encoding for Order-Preserving Matching.
- Order Preserving Pattern Matching on Trees and DAGs
- Order-preserving indexing
- Fast algorithms for single and multiple pattern Cartesian tree matching
- Position heaps for Cartesian-tree matching on strings and tries
- Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings
- A filtration method for order-preserving matching
- Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm
- Title not available (Why is that?)
- String periods in the order-preserving model
- A simple fast hybrid pattern-matching algorithm
- Order-preserving pattern matching with scaling
- An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem
- Generalized pattern matching and periodicity under substring consistent equivalence relations
- Fast Cartesian tree matching
This page was built for publication: A fast algorithm for order-preserving pattern matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477704)