On position restricted substring searching in succinct space
From MaRDI portal
Publication:2376796
DOI10.1016/J.JDA.2012.09.002zbMATH Open1267.68102OpenAlexW1989749956MaRDI QIDQ2376796FDOQ2376796
Authors: Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter 
Publication date: 24 June 2013
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2012.09.002
Recommendations
Cites Work
- Compressed representations of sequences and full-text indexes
- Indexing compressed text
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Substring Range Reporting
- Alphabet-independent compressed text indexing
- Suffix Arrays: A New Method for On-Line String Searches
- A Space-Economical Suffix Tree Construction Algorithm
- Orthogonal range searching on the RAM, revisited
- Efficient worst-case data structures for range searching
- Compressed text indexing with wildcards
- Lower bounds for orthogonal range searching: I. The reporting case
- Position-Restricted Substring Searching
- Title not available (Why is that?)
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
- Optimal prefix and suffix queries on texts
- Position-restricted substring searching over small alphabets
- 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)
