Succinct non-overlapping indexing
From MaRDI portal
Publication:2285052
DOI10.1007/s00453-019-00605-5zbMath1436.68083OpenAlexW2965282784MaRDI QIDQ2285052
Rahul Shah, Arnab Ganguly, Sharma V. Thankachan
Publication date: 16 January 2020
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-019-00605-5
Related Items (3)
String indexing for top-\(k\) close consecutive occurrences ⋮ I/O-efficient data structures for non-overlapping indexing ⋮ A framework for designing space-efficient dictionaries for parameterized and order-preserving matching
Cites Work
- Unnamed Item
- Replacing suffix trees with enhanced suffix arrays
- On-line construction of suffix trees
- On position restricted substring searching in succinct space
- Sorted Range Reporting
- Succinct Non-overlapping Indexing
- A fast string searching algorithm
- Suffix Arrays: A New Method for On-Line String Searches
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Position-Restricted Substring Searching
- Indexing compressed text
- Dictionary matching and indexing with errors and don't cares
- Range Non-overlapping Indexing and Successive List Indexing
- Online Sorted Range Reporting
- Range Non-overlapping Indexing
- Efficient randomized pattern-matching algorithms
- Fast Pattern Matching in Strings
- Algorithms on Strings, Trees and Sequences
- pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related Problems
- Structural Pattern Matching - Succinctly.
- Non-Overlapping Indexing - Cache Obliviously
- Optimal static range reporting in one dimension
- A theory of parameterized pattern matching
This page was built for publication: Succinct non-overlapping indexing