A categorization theorem on suffix arrays with applications to space efficient text indexes

No abstract is available for this paper.

• Publication year

  2005

• Venue

  ACM-SIAM Symposium on Discrete Algorithms

• Publication date

  2005-01-23

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Succinct Data Structures

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

  2003influential reference
• Linear-Time Construction of Suffix Arrays

  2003cited by this paper
• Space efficient linear time construction of suffix arrays

  2003cited by this paper
• Succinct indexable dictionaries with applications to encoding k-ary trees and multisets

  2002cited by this paper
• On compressing and indexing data

  2002cited by this paper
• An experimental study of an opportunistic index

  2001cited by this paper
• Opportunistic data structures with applications

  2000cited by this paper
• Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array

  2000cited by this paper
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)

  2000cited by this paper
• New data structures for orthogonal range searching

  2000cited by this paper
• The Art of Computer Programming: Volume 3: Sorting and Searching

  1998cited by this paper
• Efficient suffix trees on secondary storage

  1996cited by this paper
• A Block-sorting Lossless Data Compression Algorithm

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

  1993cited by this paper
• New Indices for Text: Pat Trees and Pat Arrays

  1992cited by this paper
• Inverted Files

  1992cited by this paper
• Space-efficient static trees and graphs

  1989cited by this paper
• Linear Pattern Matching Algorithms

  1973cited by this paper
• The art of computer programming: sorting and searching (volume 3)

  1973cited by this paper

• Remarkable relations between the central binomial series, Eulerian polynomials, and poly-Bernoulli numbers

  2022cites this paper
• When a dollar makes a BWT

  2021cites this paper
• When a Dollar Makes a BWT

  2019cites this paper
• Space Efficient Data Structures and Algorithms in the Word-RAM Model

  2018cites this paper
• Combinatorial Properties of Poly-Bernoulli Relatives

  2016cites this paper
• Combinatorics of poly-Bernoulli numbers

  2015influential citation
• On the Succinct Representation of Unlabeled Permutations

  2015cites this paper
• Wavelet trees: A survey

  2012cites this paper
• Space-efficient multiple string matching automata

  2012cites this paper
• On the combinatorics of suffix arrays

  2012influential citation
• On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation

  2011cites this paper
• Succinct representations of permutations and functions

  2011cites this paper
• A quick tour on suffix arrays and compressed suffix arrays

  2011cites this paper
• Autoíndices Comprimidos para Texto Basados en Lempel-Ziv

  2009cites this paper
• Character-Based Indexing Using Inverted Lists

  2009cites this paper
• An Optimized Representation for Dynamic k-ary Cardinal Trees

  2009cites this paper
• Canonical Huffman code based full-text index

  2008influential citation
• Succinct Indexes

  2008cites this paper
• A Succinct Indexes for Strings , Binary Relations and Multi-labeled Trees

  2007influential citation
• Compressed full-text indexes

  2007influential citation
• Succinct indexes for strings, binary relations and multilabeled trees

  2007cites this paper
• Succinct Text Indexes on Large Alphabet

  2006cites this paper
• Compressed Text Indexing and Range Searching

  2006cites this paper
• Rank/select operations on large alphabets: a tool for text indexing

  2006cites this paper
• Counting suffix arrays and strings

  2005cites this paper
• Succinct Suffix Arrays based on Run-Length Encoding

  2005influential citation
• Search Engines and Web Information Retrieval

  2004cites this paper