I/O-efficient data structures for non-overlapping indexing
From MaRDI portal
Publication:2220773
DOI10.1016/j.tcs.2020.12.006zbMath1477.68082OpenAlexW3110680648MaRDI QIDQ2220773
Paniz Abedin, M. Oğuzhan Külekci, Sharma V. Thankachan, Sahar Hooshmand
Publication date: 25 January 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.12.006
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved algorithms for the range next value problem and applications
- Substring range reporting
- Position-restricted substring searching over small alphabets
- On-line construction of suffix trees
- Data structures and algorithms for the string statistics problem
- Succinct non-overlapping indexing
- On position restricted substring searching in succinct space
- Sorted Range Reporting
- Succinct Non-overlapping Indexing
- The string B-tree
- Cache-Oblivious Algorithms
- Position-Restricted Substring Searching
- Cache-oblivious string dictionaries
- Range Non-overlapping Indexing and Successive List Indexing
- Range Non-overlapping Indexing
- Non-Overlapping Indexing - Cache Obliviously