Substring range reporting
From MaRDI portal
Publication:517792
DOI10.1007/S00453-012-9733-4zbMATH Open1360.68375DBLPjournals/algorithmica/BilleG14OpenAlexW2915747377WikidataQ60554401 ScholiaQ60554401MaRDI QIDQ517792FDOQ517792
Authors: Philip Bille, Inge Li Gørtz 
Publication date: 27 March 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-012-9733-4
Recommendations
Cites Work
- Algorithms on Strings, Trees and Sequences
- Preserving order in a forest in less than logarithmic time and linear space
- Filtering Search: A New Approach to Query-Answering
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Property matching and weighted matching
- Time-space trade-offs for predecessor search
- Indexing factors with gaps
- Optimal static range reporting in one dimension
- Orthogonal range searching on the RAM, revisited
- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
- Faster index for property matching
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- Range non-overlapping indexing
- Design and implementation of an efficient priority queue
- Deterministic sorting in O(nloglogn) time and linear space
- Errata for ``Faster index for property matching
- Improved data structures for the orthogonal range successor problem
- Deterministic dictionaries
- Rank and select revisited and extended
- Title not available (Why is that?)
- Position-Restricted Substring Searching
- Title not available (Why is that?)
- On the sorting-complexity of suffix tree construction
- Finding patterns in given intervals
- Improved algorithms for the range next value problem and applications
- Space efficient dynamic stabbing with fast queries
- On dynamic range reporting in one dimension
- Bounded ordered dictionaries in O(log log N) time and O(n) space
- Optimal prefix and suffix queries on texts
Cited In (11)
- Title not available (Why is that?)
- Longest common prefix with mismatches
- Reporting consecutive substring occurrences under bounded gap constraints
- I/O-efficient data structures for non-overlapping indexing
- String indexing for top-\(k\) close consecutive occurrences
- Position-Restricted Substring Searching
- Position-restricted substring searching over small alphabets
- Gapped indexing for consecutive occurrences
- Reporting consecutive substring occurrences under bounded gap constraints
- Substring Range Reporting
- On position restricted substring searching in succinct space
This page was built for publication: Substring range reporting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q517792)
