Self-indexing Based on LZ77

DOI10.1007/978-3-642-21458-5_6zbMath1339.68334OpenAlexW1528475610MaRDI QIDQ3011842

Sebastian Kreft, Gonzalo Navarro

Publication date: 29 June 2011

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21458-5_6

Mathematics Subject Classification ID

Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Genetics and epigenetics (92D10) Algorithms on strings (68W32)

Related Items

Towards efficient positional inverted index ⋮ On compressing and indexing repetitive sequences ⋮ Wavelet trees for all ⋮ A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs ⋮ Fast relative Lempel-Ziv self-index for similar sequences ⋮ Practical compressed suffix trees ⋮ Self-indexing Based on LZ77 ⋮ Flexible indexing of repetitive collections ⋮ Unnamed Item ⋮ Space-efficient fully dynamic DFS in undirected graphs ⋮ LZ-End Parsing in Linear Time

Uses Software

• PATRICIA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representing trees of higher degree
• Indexing text using the Ziv--Lempel trie
• Rank and select revisited and extended
• Compressed representations of sequences and full-text indexes
• Self-indexing Based on LZ77
• Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• An analysis of the Burrows—Wheeler transform
• Indexing compressed text
• Optimal Succinctness for Range Minimum Queries
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• New text indexing functionalities of the compressed suffix arrays
• Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
• Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections

This page was built for publication: Self-indexing Based on LZ77