Position heaps for Cartesian-tree matching on strings and tries
From MaRDI portal
Publication:2146147
Cites work
- scientific article; zbMATH DE number 1670815 (Why is no real title available?)
- scientific article; zbMATH DE number 910912 (Why is no real title available?)
- A fast algorithm for order-preserving pattern matching
- A theory of parameterized pattern matching
- Fast algorithms for single and multiple pattern Cartesian tree matching
- Fast incremental planarity testing
- File structures using hashing functions
- Finding patterns and periods in Cartesian tree matching
- Generalized pattern matching and periodicity under substring consistent equivalence relations
- Improved dynamic dictionary matching
- Order-preserving indexing
- Order-preserving matching
- Palindrome pattern matching
- Parameterized pattern matching: Algorithms and applications
- Position heaps: a simple and dynamic text indexing data structure
- The level ancestor problem simplified
- The parameterized position heap of a trie
This page was built for publication: Position heaps for Cartesian-tree matching on strings and tries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146147)