Fast Cartesian tree matching
From MaRDI portal
Publication:6536248
Recommendations
Cites work
- A fast algorithm for order-preserving pattern matching
- A filtration method for order-preserving matching
- A linear time algorithm for consecutive permutation pattern matching
- A theory of parameterized pattern matching
- A unifying look at data structures
- Algorithms for jumbled pattern matching in strings
- Alphabet dependence in parameterized matching
- Approximate swapped matching.
- Cartesian Tree Matching and Indexing
- Fast Pattern Matching in Strings
- Improving practical exact string matching
- On representations of ternary order relations in numeric strings
- Order-preserving matching
- Overlap matching.
- Pattern Matching with Swaps
This page was built for publication: Fast Cartesian tree matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536248)