Position-restricted substring searching over small alphabets
From MaRDI portal
Publication:1679612
DOI10.1016/j.jda.2017.10.001zbMath1375.68230OpenAlexW2762394485MaRDI QIDQ1679612
Sudip Biswas, Sharma V. Thankachan, Tsung-Han Ku, Rahul Shah
Publication date: 9 November 2017
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2017.10.001
Related Items (4)
Position-restricted substring searching over small alphabets ⋮ Practical Wavelet Tree Construction ⋮ I/O-efficient data structures for non-overlapping indexing ⋮ Ranked document selection
Cites Work
- Improved algorithms for the range next value problem and applications
- Substring range reporting
- Position-restricted substring searching over small alphabets
- Improved dynamic dictionary matching
- Geometric BWT: compressed text indexing via sparse suffixes and range searching
- On position restricted substring searching in succinct space
- Sorted Range Reporting
- Succinct Non-overlapping Indexing
- Suffix Arrays: A New Method for On-Line String Searches
- Position-Restricted Substring Searching
- Rank/select operations on large alphabets
- Range Non-overlapping Indexing and Successive List Indexing
- Range Non-overlapping Indexing
- A Space-Economical Suffix Tree Construction Algorithm
- Orthogonal range searching on the RAM, revisited
This page was built for publication: Position-restricted substring searching over small alphabets