On compressing and indexing repetitive sequences
From MaRDI portal
(Redirected from Publication:390894)
Recommendations
Cites work
- scientific article; zbMATH DE number 3913711 (Why is no real title available?)
- scientific article; zbMATH DE number 3672160 (Why is no real title available?)
- scientific article; zbMATH DE number 1263249 (Why is no real title available?)
- scientific article; zbMATH DE number 2038722 (Why is no real title available?)
- scientific article; zbMATH DE number 2038766 (Why is no real title available?)
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- scientific article; zbMATH DE number 6146456 (Why is no real title available?)
- scientific article; zbMATH DE number 2230164 (Why is no real title available?)
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- A universal algorithm for sequential data compression
- An Online Algorithm for Finding the Longest Previous Factors
- An analysis of the Burrows-Wheeler transform
- An implicit data structure supporting insertion, deletion, and search in O( ^ 2\,n) time
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Breaking a time-and-space barrier in constructing full-text indices
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressed representations of sequences and full-text indexes
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms
- Compression of individual sequences via variable-rate coding
- Faster entropy-bounded compressed suffix trees
- Fully-Compressed Suffix Trees
- Fully-functional succinct trees
- Implementing the LZ-index, theory versus practice
- Indexing compressed text
- Indexing text using the Ziv--Lempel trie
- Large alphabets and incompressibility
- Lempel-Ziv factorization using less time \& space
- Log-logarithmic worst-case range queries are possible in space theta(N)
- New text indexing functionalities of the compressed suffix arrays
- On the Complexity of Finite Sequences
- Optimal succinctness for range minimum queries
- Random access to grammar-compressed strings
- Rank and select revisited and extended
- Reducing the Space Requirement of LZ-Index
- Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval
- Representing trees of higher degree
- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
- Self-indexed Text Compression Using Straight-Line Programs
- Self-indexed grammar-based compression
- Self-indexing based on LZ77
- Squeezing succinct data structures into entropy bounds
- Stronger Lempel-Ziv based compressed text indexing
- Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets
- Suffix Arrays: A New Method for On-Line String Searches
- Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm
Cited in
(55)- Near-optimal search time in \(\delta \)-optimal space, and vice versa
- Storage and Retrieval of Individual Genomes
- Fast relative Lempel-Ziv self-index for similar sequences
- Block trees
- Interval-based approach to lexicographic representation and compression of numeric data
- Grammar compressed sequences with rank/select support
- Efficient fully-compressed sequence representations
- Compressed Data Structures for Dynamic Sequences
- Comparison of LZ77-type parsings
- Flexible indexing of repetitive collections
- Block graphs in practice
- Faster repetition-aware compressed suffix trees based on block trees
- Self-indexed grammar-based compression
- LZ77 computation based on the run-length encoded BWT
- Self-indexing based on LZ77
- FM-index of alignment: a compressed index for similar strings
- A new class of searchable and provably highly compressible string transformations
- Computational graph pangenomics: a tutorial on data structures and their applications
- A separation between RLSLPs and LZ77
- Document listing on repetitive collections with guaranteed performance
- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
- Compression with the tudocomp framework
- An LMS-based grammar self-index with local consistency properties
- Compact binary relation representations with rich functionality
- String Indexing with Compressed Patterns
- Composite repetition-aware data structures
- Lempel-Ziv compressed structures for document retrieval
- Relations between greedy and bit-optimal LZ77 encodings
- Grammar-compressed indexes with logarithmic search time
- Orthogonal range searching for text indexing
- scientific article; zbMATH DE number 6792413 (Why is no real title available?)
- On the approximation ratio of LZ-end to LZ77
- Near-optimal search time in \(\delta \)-optimal space
- Indexing highly repetitive collections
- A compressed dynamic self-index for highly repetitive text collections
- Faster repetition-aware compressed suffix trees based on block trees
- Linear-size CDAWG: new repetition-aware indexing and grammar compression
- Bicriteria data compression
- Sensitivity of string compressors and repetitiveness measures
- A space-optimal grammar compression
- Time-space trade-offs for Lempel-Ziv compressed indexing
- FM-index of alignment with gaps
- Fast relative Lempel-Ziv self-index for similar sequences
- On two LZ78-style grammars: compression bounds and compressed-space computation
- Faster compressed suffix trees for repetitive collections
- Universal compressed text indexing
- LZ-End Parsing in Linear Time
- Hybrid indexes for repetitive datasets
- A self-index on block trees
- \(r\)-indexing the eBWT
- New advances in rightmost Lempel-Ziv
- On the number of factors in the LZ-End factorization
- Sublinear time Lempel-Ziv (LZ77) factorization
- Iterated straight-line programs
- Lazy Lempel-Ziv factorization algorithms
This page was built for publication: On compressing and indexing repetitive sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390894)
