Finger search in grammar-compressed strings (Q2322694): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60554312, #quickstatements; #temporary_batch_1707303357582
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: W2964197518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Access, Rank, and Select in Grammar-compressed Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An almost optimal algorithm for unbounded searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed subsequence matching and packed tree coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fingerprints in compressed strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Access to Grammar-Compressed Strings and Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4643837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal finger search trees in the pointer machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Smallest Grammar Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Indexed Grammar-Based Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bookmarks in grammar-compressed strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant update time finger search tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Grammar-Based Self-index / rank
 
Normal rank
Property / cites work
 
Property / cites work: LZ77-Based Self-indexing with Faster Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate pattern matching in LZ77-compressed texts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block graphs in practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting regularities on grammar-compressed strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient randomized pattern-matching algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammar-based codes: a new class of universal lossless source codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal lossless compression via multilevel pattern matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammar compressed sequences with rank/select support / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Dynamic Data Structure for LCE Queries in Compressed Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2728909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed automata for dictionary matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and implementation of an efficient priority queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression of individual sequences via variable-rate coding / rank
 
Normal rank

Latest revision as of 08:42, 20 July 2024

scientific article
Language Label Description Also known as
English
Finger search in grammar-compressed strings
scientific article

    Statements

    Finger search in grammar-compressed strings (English)
    0 references
    0 references
    0 references
    0 references
    5 September 2019
    0 references
    compression
    0 references
    grammars
    0 references
    finger search
    0 references
    algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers