A Lempel-Ziv Compressed Structure for Document Listing

No abstract is available for this paper.

• Publication year

  2013

• Venue

  SPIRE

• Publication date

  2013-10-07

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-319-02432-5_16
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Spaces, Trees, and Colors

  2013cited by this paper
• Algorithms – ESA 2011

  2011cited by this paper
• Practical Compressed Document Retrieval

  2011cited by this paper
• Alphabet-Independent Compressed Text Indexing

  2011cited by this paper
• Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays

  2011influential reference
• Extracting Powers and Periods in a String from Its Runs Structure

  2010cited by this paper
• Stronger Lempel-Ziv Based Compressed Text Indexing

  2010cited by this paper
• New algorithms on wavelet trees and applications to information retrieval

  2010cited by this paper
• Space-Efficient Framework for Top-k String Retrieval Problems

  2009cited by this paper
• Alphabet Partitioning for Compressed Rank/Select and Applications

  2009cited by this paper
• Range Quantile Queries: Another Virtue of Wavelet Trees

  2009cited by this paper
• Alphabet Partitioning for Compressed Rank/Select with Applications

  2009cited by this paper
• Compressed representations of sequences and full-text indexes

  2007cited by this paper
• Compressed text indexes: From theory to practice

  2007cited by this paper
• Succinct data structures for flexible text retrieval systems

  2007influential reference
• Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets

  2007cited by this paper
• Compressed full-text indexes

  2007cited by this paper
• Space-Efficient Algorithms for Document Retrieval

  2007influential reference
• Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings

  2007cited by this paper
• On the Size of Succinct Indices

  2007cited by this paper
• New text indexing functionalities of the compressed suffix arrays

  2003cited by this paper
• High-order entropy-compressed text indexes

  2003cited by this paper
• Efficient algorithms for document retrieval problems

  2002influential reference
• Indexing text using the Ziv-Lempel trie

  2002cited by this paper
• A novel autosomal dominant distal myopathy with early respiratory failure

  2001cited by this paper
• Compression of low entropy strings with Lempel-Ziv algorithms

  1997cited by this paper
• Suffix arrays: a new method for on-line string searches

  1993cited by this paper
• Compression of individual sequences via variable-rate coding

  1978cited by this paper
• Linear Pattern Matching Algorithms

  1973cited by this paper

• Engineering Practical Lempel-Ziv Tries

  2021cites this paper
• Lempel-Ziv compressed structures for document retrieval

  2019cites this paper
• LZ78 Compression in Low Main Memory Space

  2017cites this paper
• Document retrieval on repetitive string collections

  2016influential citation
• Hybrid Indexing for Versioned Document Search with Cluster-based Retrieval

  2016cites this paper
• Document Retrieval on Repetitive Collections

  2014cites this paper
• Efficient Compressed Indexing for Approximate Top-k String Retrieval

  2014cites this paper
• Spaces, Trees, and Colors

  2013cites this paper