Extending the Burrows-Wheeler transform for Cartesian tree matching and constructing it
From MaRDI portal
Cites work
- A Compact Index for Cartesian Tree Matching
- A linear time algorithm for consecutive permutation pattern matching
- A unifying look at data structures
- An extension of the Burrows-Wheeler transform
- Approximate Cartesian tree matching: an approach using swaps
- Approximate Cartesian tree pattern matching
- Breaking a barrier in constructing compact indexes for parameterized pattern matching
- Cartesian tree subsequence matching
- Computing Covers Under Substring Consistent Equivalence Relations
- Computing maximal palindromes in non-standard matching models
- Computing the parameterized Burrows-Wheeler transform online
- Efficient algorithm for circular Burrows-Wheeler transform
- Fast algorithms for single and multiple pattern Cartesian tree matching
- Finding patterns and periods in Cartesian tree matching
- Fully functional static and dynamic succinct trees
- Generalized pattern matching and periodicity under substring consistent equivalence relations
- On Cartesian trees and range minimum queries
- On Indeterminate Strings Matching.
- Opportunistic data structures with applications
- Optimal succinctness for range minimum queries
- Order-preserving matching
- Position heaps for Cartesian-tree matching on strings and tries
- r-indexing the eBWT
This page was built for publication: Extending the Burrows-Wheeler transform for Cartesian tree matching and constructing it
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299461)
