Efficient fully-compressed sequence representations (Q472482): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973228454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact Rich-Functional Binary Relation Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive searching in succinctly encoded binary relations and tree-structured documents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct indexes for strings, binary relations and multilabeled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental investigation of set intersection algorithms for text searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPRESSED REPRESENTATIONS OF PERMUTATIONS, AND APPLICATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On compressing permutations and adaptive sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alphabet-Independent Compressed Text Indexing / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Lower and Upper Bounds for Representing Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the Burrows—Wheeler transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate string matching with compressed indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Compact Web Graph Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressing and indexing labeled trees, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexing compressed text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed representations of sequences and full-text indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple storage scheme for strings achieving entropy bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Optimal Adaptive Prefix Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal lower bounds for rank and select indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Succinct Indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank/select operations on large alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Redundancy of Succinct Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Encoding of Succinct Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Trade-Offs for Succinct String Indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storing a Compressed Function with Constant Time Access / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for the Construction of Minimum-Redundancy Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting shuffled monotone sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank and select revisited and extended / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic entropy-compressed sequences and full-text indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representations of permutations and functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Dynamic Sequence Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Entropy-Compressed Rank/Select Dictionary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct indexable dictionaries with applications to encoding <i>k</i> -ary trees, prefix sums and multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: New text indexing functionalities of the compressed suffix arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Squeezing succinct data structures into entropy bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case Analysis of Set Union Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833659 / rank
 
Normal rank

Revision as of 07:19, 9 July 2024

scientific article
Language Label Description Also known as
English
Efficient fully-compressed sequence representations
scientific article

    Statements

    Efficient fully-compressed sequence representations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 November 2014
    0 references
    compressed sequence representations
    0 references
    rank and select on sequences
    0 references
    compact data structures
    0 references
    entropy-bounded structures
    0 references
    compressed text indexing
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers