Rank/select operations on large alphabets
From MaRDI portal
Publication:3581537
DOI10.1145/1109557.1109599zbMath1192.68800OpenAlexW4254779780MaRDI QIDQ3581537
J. Ian Munro, S. Srinivasa Rao, Alexander Golynski
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109599
Related Items (47)
Less space: indexing for queries with wildcards ⋮ Space-efficient indexes for forbidden extension queries ⋮ Access, Rank, and Select in Grammar-compressed Strings ⋮ Compressed Data Structures for Dynamic Sequences ⋮ Unnamed Item ⋮ Fast and compact regular expression matching ⋮ GLOUDS: representing tree-like graphs ⋮ Self-indexed Text Compression Using Straight-Line Programs ⋮ Space-Efficient Frameworks for Top- k String Retrieval ⋮ Grammar compressed sequences with rank/select support ⋮ The range 1 query (R1Q) problem ⋮ Grammar-compressed indexes with logarithmic search time ⋮ Succinct encodings for families of interval graphs ⋮ Compressed directed acyclic word graph with application in local alignment ⋮ Succinct encoding of binary strings representing triangulations ⋮ Compact binary relation representations with rich functionality ⋮ Position-restricted substring searching over small alphabets ⋮ Succinct encoding of arbitrary graphs ⋮ On compressing permutations and adaptive sorting ⋮ Cross-document pattern matching ⋮ Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number ⋮ New algorithms on wavelet trees and applications to information retrieval ⋮ Stronger Lempel-Ziv based compressed text indexing ⋮ Random access in persistent strings and segment selection ⋮ Succinct data structure for path graphs ⋮ Succinct representations of permutations and functions ⋮ Unnamed Item ⋮ Wavelet trees for all ⋮ Fast relative Lempel-Ziv self-index for similar sequences ⋮ Succinct Representations of Arbitrary Graphs ⋮ Efficient fully-compressed sequence representations ⋮ siEDM: an efficient string index and search algorithm for edit distance with moves ⋮ Approximate query processing over static sets and sliding windows ⋮ Adaptive searching in succinctly encoded binary relations and tree-structured documents ⋮ Fast compressed self-indexes with deterministic linear-time construction ⋮ Spaces, Trees, and Colors ⋮ Unnamed Item ⋮ Ranked document retrieval for multiple patterns ⋮ Compact representation of graphs of small clique-width ⋮ Dynamic rank/select structures with applications to run-length encoded texts ⋮ Rank/select on dynamic compressed sequences and applications ⋮ Parallel computation of the Burrows Wheeler transform in compact space ⋮ General Document Retrieval in Compact Space ⋮ A Space-Optimal Grammar Compression. ⋮ From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures ⋮ Orthogonal Range Searching for Text Indexing ⋮ Fast Compressed Self-Indexes with Deterministic Linear-Time Construction
This page was built for publication: Rank/select operations on large alphabets
