Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
From MaRDI portal
Recommendations
- Orthogonal range searching for text indexing
- scientific article; zbMATH DE number 7651193
- Compact and succinct data structures for multidimensional orthogonal range searching
- Succinct indices for range queries with applications to orthogonal range maxima
- scientific article; zbMATH DE number 2086648
- On the average performance of orthogonal range search in multidimensional data structures
- Space-Time Trade-Offs for Orthogonal Range Queries
- scientific article; zbMATH DE number 7651115
- Orthogonal range searching in linear and almost-linear space
- Orthogonal Range Searching in Linear and Almost-Linear Space
Cites work
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Adaptive searching in succinctly encoded binary relations and tree-structured documents
- Compressed representations of sequences and full-text indexes
- Efficient data structures for range searching on a grid
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 871936 (Why is no real title available?)
- Orthogonal range searching in linear and almost-linear space
- Planar stage graphs: Characterizations and applications
- Rank and select revisited and extended
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- Succinct indexes for strings, binary relations and multi-labeled trees
- Succinct ordinal trees with level-ancestor queries
Cited in
(35)- Path queries on functions
- \(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity
- Succinct navigational oracles for families of intersection graphs on a circle
- Succinct indices for path minimum, with applications
- On position restricted substring searching in succinct space
- On finding the Adams consensus tree
- Wavelet trees for all
- Fast relative Lempel-Ziv self-index for similar sequences
- Succinct encodings for families of interval graphs
- Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number
- Succinct permutation graphs
- Succinct and Implicit Data Structures for Computational Geometry
- Orthogonal range searching for text indexing
- Array range queries
- An Opportunistic Text Indexing Structure Based on Run Length Encoding
- Two dimensional range minimum queries and Fibonacci lattices
- Longest common prefix with mismatches
- Succincter text indexing with wildcards
- Substring Range Reporting
- On the Size of Succinct Indices
- Compact binary relation representations with rich functionality
- Space efficient data structures for dynamic orthogonal range counting
- Entropy-bounded representation of point grids
- Compressed indexes for text with wildcards
- Space-efficient data-analysis queries on grids
- New algorithms on wavelet trees and applications to information retrieval
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Substring range reporting
- Efficient Data Structures for the Orthogonal Range Successor Problem
- Discrete range searching primitive for the GPU and its applications
- scientific article; zbMATH DE number 7651193 (Why is no real title available?)
- Improved data structures for the orthogonal range successor problem
- Succinct data structures for segments
- Succinct data structures for chordal graph with bounded leafage or vertex leafage
- Compact and succinct data structures for multidimensional orthogonal range searching
This page was built for publication: Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183444)
