On position restricted substring searching in succinct space
From MaRDI portal
Publication:2376796
Recommendations
Cites work
- scientific article; zbMATH DE number 6146456 (Why is no real title available?)
- A Space-Economical Suffix Tree Construction Algorithm
- Alphabet-independent compressed text indexing
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressed representations of sequences and full-text indexes
- Compressed text indexing with wildcards
- Efficient worst-case data structures for range searching
- Indexing compressed text
- Lower bounds for orthogonal range searching: I. The reporting case
- Orthogonal range searching on the RAM, revisited
- Position-Restricted Substring Searching
- Substring Range Reporting
- Suffix Arrays: A New Method for On-Line String Searches
Cited in
(14)- Optimal prefix and suffix queries on texts
- Improved and extended locating functionality on compressed suffix arrays
- Substring range reporting
- I/O-efficient data structures for non-overlapping indexing
- Succinct non-overlapping indexing
- Ranked document selection
- Orthogonal range searching for text indexing
- Space-efficient frameworks for top-\(k\) string retrieval
- Top-k term-proximity in succinct space
- Position-Restricted Substring Searching
- Succinct Non-overlapping Indexing
- Position-restricted substring searching over small alphabets
- Optimal prefix and suffix queries on texts
- Generalized substring compression
This page was built for publication: On position restricted substring searching in succinct space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376796)