Universal compressed text indexing (Q1729689): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Prefix Search in Little Space, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Label Extraction in the CDAWG / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composite Repetition-Aware Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Range Predecessor and Lempel-Ziv Parsing / 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: Time-space trade-offs for Lempel-Ziv compressed indexing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Common Extensions in Sublinear Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete inverted files for efficient text retrieval and analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal range searching on the RAM, revisited / 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: Construction of Aho Corasick automaton in linear time for integer alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexing compressed text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large alphabets and incompressibility / 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: On the approximation ratio of Lempel-Ziv parsing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Suffix Tree Construction in Optimal Time and Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic sorting in O(nloglogn) time and linear space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of grammar-based compression via recompression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \textit{really} simple approximation of smallest grammar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear work suffix array construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient randomized pattern-matching algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: At the roots of dictionary compression: string attractors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collage system: A unifying framework for compressed pattern matching. / 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: On compressing and indexing repetitive sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Finite Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suffix Arrays: A New Method for On-Line String Searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Self-index on Block Trees / 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: Time-space trade-offs for predecessor search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Efficient Dictionaries in Close to Sorting Time / 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: A fully linear-time approximation algorithm for grammar-based compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data compression via textual substitution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree / rank
 
Normal rank

Latest revision as of 09:42, 18 July 2024

scientific article
Language Label Description Also known as
English
Universal compressed text indexing
scientific article

    Statements

    Universal compressed text indexing (English)
    0 references
    0 references
    0 references
    28 February 2019
    0 references
    repetitive sequences
    0 references
    compressed indexes
    0 references
    string attractors
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references