On compressing and indexing repetitive sequences (Q390894): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2101881908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-indexing Based on LZ77 / 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: Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690245 / 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: An analysis of the Burrows—Wheeler transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large alphabets and incompressibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Finite Sequences / 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
Property / cites work
 
Property / cites work: Self-indexed Text Compression Using Straight-Line Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365049 / 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: Indexing text using the Ziv--Lempel trie / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexing compressed text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing the Space Requirement of LZ-Index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections / 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: Q5708460 / 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: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression of Low Entropy Strings with Lempel--Ziv Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3869197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing trees of higher degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank and select revisited and extended / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Succinctness for Range Minimum Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster entropy-bounded compressed suffix trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lempel-Ziv factorization using less time \& space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log-logarithmic worst-case range queries are possible in space theta(N) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger Lempel-Ziv based compressed text indexing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Online Algorithm for Finding the Longest Previous Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing the LZ-index / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Indexed Grammar-Based Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking a Time-and-Space Barrier in Constructing Full-Text Indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully-Compressed Suffix Trees / rank
 
Normal rank

Latest revision as of 04:35, 7 July 2024

scientific article
Language Label Description Also known as
English
On compressing and indexing repetitive sequences
scientific article

    Statements

    On compressing and indexing repetitive sequences (English)
    0 references
    0 references
    0 references
    9 January 2014
    0 references
    compression
    0 references
    repetitive texts
    0 references
    self-indexing
    0 references
    Lempel-Ziv
    0 references
    succinct data structures
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers