Data structures for efficient string algorithms.
From MaRDI portal
Publication:3521160
Recommendations
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Two-Dimensional Range Minimum Queries
- Optimal succinctness for range minimum queries
Cited in
(6)- Construction of Fundamental Data Structures for Strings
- scientific article; zbMATH DE number 1982178 (Why is no real title available?)
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- Encodings of range maximum-sum segment queries and applications
- String Processing and Information Retrieval
This page was built for publication: Data structures for efficient string algorithms.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3521160)