Lempel-Ziv factorization powered by space efficient suffix trees (Q724218): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Improved dynamic dictionary matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time construction of compressed text indices in compact space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Range Predecessor and Lempel-Ziv Parsing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed suffix trees with full functionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing trees of higher degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transducers and repetitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computation of local periods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Raising Permutations to Powers in Place / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Functional Static and Dynamic Succinct Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexing compressed text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alphabet-Dependent String Searching with Wexponential Search Trees / 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: Radix Sorting with No Extra Space / 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: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for finding and representing all the tandem repeats in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression of individual sequences via variable-rate coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultra-succinct representation of ordered trees with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linked dynamic tries with applications to LZ-compression in sublinear time and space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lempel-Ziv index for \(q\)-grams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear work suffix array construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Lempel-Ziv Factorization: Simple, Fast, Small / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting leftmost maximal periodicities / 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: Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing LZ78 tries and position heaps in linear time for large alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexing text using the Ziv--Lempel trie / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Dynamic Sequence Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully-Compressed Suffix Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828936 / 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: Data compression via textual substitution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering a compressed suffix tree implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank

Latest revision as of 04:37, 16 July 2024

scientific article
Language Label Description Also known as
English
Lempel-Ziv factorization powered by space efficient suffix trees
scientific article

    Statements

    Lempel-Ziv factorization powered by space efficient suffix trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 July 2018
    0 references
    Lempel-Ziv
    0 references
    lossless compression
    0 references
    succinct suffix trees
    0 references
    0 references

    Identifiers