Cartesian Tree Matching and Indexing
From MaRDI portal
Recommendations
Cites work
- A Generalization of the Suffix Tree to Square Matrices, with Applications
- A linear time algorithm for consecutive permutation pattern matching
- A Space-Economical Suffix Tree Construction Algorithm
- A theory of parameterized pattern matching
- Algorithms for jumbled pattern matching in strings
- Algorithms – ESA 2004
- Alphabet dependence in parameterized matching
- Approximate swapped matching.
- Efficient string matching
- Fast Pattern Matching in Strings
- Faster suffix tree construction with missing suffix links
- On approximate jumbled pattern matching in strings
- On Cartesian trees and range minimum queries
- On representations of ternary order relations in numeric strings
- On-line construction of parameterized suffix trees for large alphabets
- On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
- Order-preserving indexing
- Order-preserving matching
- Overlap matching.
- Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
- Parameterized matching with mismatches
- Pattern Matching with Swaps
- String Periods in the Order-Preserving Model
Cited in
(10)- Fast algorithms for single and multiple pattern Cartesian tree matching
- TREE-BASED 2D INDEXING
- Sufficient conditions for efficient indexing under different matchings
- Fast Cartesian tree matching
- Approximate Cartesian tree matching: an approach using swaps
- On the complexity of indeterminate strings matching
- Approximate Cartesian tree pattern matching
- Approximate Cartesian tree pattern matching
- Approximate Cartesian tree matching with one difference
- Fast multiple pattern Cartesian tree matching
This page was built for publication: Cartesian Tree Matching and Indexing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088906)
