Pages that link to "Item:Q876708"
From MaRDI portal
The following pages link to Indexing text using the Ziv--Lempel trie (Q876708):
Displaying 23 items.
- On compressing and indexing repetitive sequences (Q390894) (← links)
- New algorithms on wavelet trees and applications to information retrieval (Q418727) (← links)
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (Q450552) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- A faster algorithm for the computation of string convolutions using LZ78 parsing (Q765493) (← links)
- Indexing text using the Ziv--Lempel trie (Q876708) (← links)
- Comparison of LZ77-type parsings (Q1621503) (← links)
- Approximate string matching with compressed indexes (Q1662494) (← links)
- Lempel-Ziv compressed structures for document retrieval (Q2272976) (← links)
- Linked dynamic tries with applications to LZ-compression in sublinear time and space (Q2350903) (← links)
- Stronger Lempel-Ziv based compressed text indexing (Q2428663) (← links)
- Wavelet trees for all (Q2442812) (← links)
- Rank and select revisited and extended (Q2465064) (← links)
- Sensitivity of string compressors and repetitiveness measures (Q2687989) (← links)
- Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree (Q2942273) (← links)
- Worst Case Efficient Single and Multiple String Matching in the RAM Model (Q3000497) (← links)
- Self-indexing Based on LZ77 (Q3011842) (← links)
- Self-indexed Text Compression Using Straight-Line Programs (Q3182928) (← links)
- A SIMPLE ALPHABET-INDEPENDENT FM-INDEX (Q3421851) (← links)
- (Q5088899) (← links)
- LZ-End Parsing in Linear Time (Q5111742) (← links)
- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space (Q5458854) (← links)
