Position-restricted substring searching over small alphabets
From MaRDI portal
Recommendations
Cites work
- A Space-Economical Suffix Tree Construction Algorithm
- Geometric BWT: compressed text indexing via sparse suffixes and range searching
- Improved algorithms for the range next value problem and applications
- Improved dynamic dictionary matching
- On position restricted substring searching in succinct space
- Orthogonal range searching on the RAM, revisited
- Position-Restricted Substring Searching
- Position-restricted substring searching over small alphabets
- Range Non-overlapping Indexing and Successive List Indexing
- Range non-overlapping indexing
- Rank/select operations on large alphabets
- Sorted range reporting
- Substring range reporting
- Succinct Non-overlapping Indexing
- Suffix Arrays: A New Method for On-Line String Searches
Cited in
(10)- Optimal prefix and suffix queries on texts
- Practical Wavelet Tree Construction
- Substring range reporting
- I/O-efficient data structures for non-overlapping indexing
- Efficient indexes for the positional pattern matching problem and two related problems over small alphabets
- Ranked document selection
- Position-Restricted Substring Searching
- Position-restricted substring searching over small alphabets
- Optimal prefix and suffix queries on texts
- On position restricted substring searching in succinct space
This page was built for publication: Position-restricted substring searching over small alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679612)