Indexing text using the Ziv--Lempel trie

From MaRDI portal
Publication:876708


DOI10.1016/S1570-8667(03)00066-2zbMath1118.68443MaRDI QIDQ876708

Gonzalo Navarro

Publication date: 26 April 2007

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1570-8667(03)00066-2

zbMATH Keywords

succinct data structures; author keywords: self-indexing; compressed pattern matching; compressed text


Mathematics Subject Classification ID

68P05: Data structures


Related Items

Unnamed Item, LZ-End Parsing in Linear Time, Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space, On compressing and indexing repetitive sequences, New algorithms on wavelet trees and applications to information retrieval, Worst-case efficient single and multiple string matching on packed texts in the word-RAM model, Space-efficient construction of Lempel-Ziv compressed text indexes, Lempel-Ziv factorization powered by space efficient suffix trees, A faster algorithm for the computation of string convolutions using LZ78 parsing, Indexing text using the Ziv--Lempel trie, Comparison of LZ77-type parsings, Approximate string matching with compressed indexes, Lempel-Ziv compressed structures for document retrieval, Linked dynamic tries with applications to LZ-compression in sublinear time and space, Stronger Lempel-Ziv based compressed text indexing, Wavelet trees for all, Rank and select revisited and extended, Sensitivity of string compressors and repetitiveness measures, Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree, Worst Case Efficient Single and Multiple String Matching in the RAM Model, Self-indexing Based on LZ77, Self-indexed Text Compression Using Straight-Line Programs, A SIMPLE ALPHABET-INDEPENDENT FM-INDEX



Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:876708&oldid=12828898"
Powered by MediaWiki