Rank/select operations on large alphabets
From MaRDI portal
Cited in
(52)- Space-efficient indexes for forbidden extension queries
- The range 1 query (R1Q) problem
- Position-restricted substring searching over small alphabets
- siEDM: an efficient string index and search algorithm for edit distance with moves
- Ranked document retrieval for multiple patterns
- Approximate query processing over static sets and sliding windows
- Fast compressed self-indexes with deterministic linear-time construction
- Parallel computation of the Burrows Wheeler transform in compact space
- Fast and compact regular expression matching
- Grammar compressed sequences with rank/select support
- Stronger Lempel-Ziv based compressed text indexing
- Wavelet trees for all
- Fast relative Lempel-Ziv self-index for similar sequences
- Adaptive searching in succinctly encoded binary relations and tree-structured documents
- GLOUDS: representing tree-like graphs
- Grammar-compressed indexes with logarithmic search time
- Succinct encodings for families of interval graphs
- Succinct encoding of binary strings representing triangulations
- Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number
- General document retrieval in compact space
- From time to space: fast algorithms that yield small and fast data structures
- Orthogonal range searching for text indexing
- Less space: indexing for queries with wildcards
- Self-indexed Text Compression Using Straight-Line Programs
- Space-efficient frameworks for top-k string retrieval
- Succinct oblivious RAM
- Access, rank, and select in grammar-compressed strings
- Compressed Data Structures for Dynamic Sequences
- Succinct Representations of Arbitrary Graphs
- Compressed directed acyclic word graph with application in local alignment
- Compact binary relation representations with rich functionality
- Succinct encoding of arbitrary graphs
- On compressing permutations and adaptive sorting
- Cross-document pattern matching
- New algorithms on wavelet trees and applications to information retrieval
- Succinct representations of permutations and functions
- Efficient fully-compressed sequence representations
- Approximate query processing over static sets and sliding windows
- A space-optimal grammar compression
- Fast Compressed Self-Indexes with Deterministic Linear-Time Construction
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- scientific article; zbMATH DE number 7765406 (Why is no real title available?)
- Random access in persistent strings and segment selection
- Succinct data structure for path graphs
- A practical alphabet-partitioning rank/select data structure
- Succinct data structure for chordal graphs with bounded vertex leafage
- Optimal-time queries on BWT-runs compressed indexes
- Compact representation of graphs of small clique-width
- Enhancing generalized compressed suffix trees, with applications
- Dynamic rank/select structures with applications to run-length encoded texts
- Rank/select on dynamic compressed sequences and applications
- Optimal static fully indexable dictionaries
This page was built for publication: Rank/select operations on large alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581537)
