Sorted consecutive occurrence queries in substrings
From MaRDI portal
Cites work
- A data structure for dynamic trees
- Compressed indexing for consecutive occurrences
- Computational geometry. Algorithms and applications.
- Conditional lower bounds for space/time tradeoffs
- Consecutive occurrences with distance constraints
- Constructing Efficient Dictionaries in Close to Sorting Time
- Dynamic and internal longest common substring
- Dynamic integer sets with optimal rank, select, and predecessor search
- Filtering Search: A New Approach to Query-Answering
- Finding top-k longest palindromes in substrings
- Fractional cascading. I: A data structuring technique
- Gapped indexing for consecutive occurrences
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- I/O-efficient data structures for non-overlapping indexing
- Improved algorithms for the range next value problem and applications
- Internal pattern matching queries in a text and applications
- Internal Quasiperiod Queries
- Internal shortest absent word queries in constant time and linear space
- Minimal suffix and rotation of a substring in optimal time
- Non-overlapping indexing in BWT-runs bounded space
- Online sorted range reporting
- Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
- Range non-overlapping indexing
- Range Non-overlapping Indexing and Successive List Indexing
- Rank and select revisited and extended
- Reporting consecutive substring occurrences under bounded gap constraints
- Sorted range reporting
- String indexing for top-\(k\) close consecutive occurrences
- Substring range reporting
- Succinct non-overlapping indexing
This page was built for publication: Sorted consecutive occurrence queries in substrings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299459)
