Locally compressed suffix arrays

DOI10.1145/2594408MaRDI QIDQ2828176zbMATH OpenOpenAlexFDO

Authors Héctor Ferrada, Rodrigo González, Gonzalo Navarro

Publication date 24 October 2016

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2594408

zbMATH Keywords

compressed suffix arraysRe-Pairtext databases

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Relative Lempel-Ziv Compression of Suffix Arrays
• scientific article; zbMATH DE number 6469201
• When indexing equals compression, experiments with compressing suffix arrays and applications
• scientific article; zbMATH DE number 1615289
• New text indexing functionalities of the compressed suffix arrays

Cites work

• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences
• Alphabet-independent compressed text indexing
• An analysis of the Burrows-Wheeler transform
• Colored range queries and document retrieval
• Compressed representations of sequences and full-text indexes
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Compressed suffix trees with full functionality
• Compressed Text Indexes with Fast Locate
• Compressed text indexes, from theory to practice
• Efficient Storage and Retrieval by Content and Address of Static Files
• Extended compact web graph representations
• Fast text searching for regular expressions or automaton searching on tries
• Faster entropy-bounded compressed suffix trees
• Fully compressed suffix trees
• scientific article; zbMATH DE number 1615289 (Why is no real title available?)
• scientific article; zbMATH DE number 3913711 (Why is no real title available?)
• scientific article; zbMATH DE number 1998345 (Why is no real title available?)
• scientific article; zbMATH DE number 2079421 (Why is no real title available?)
• scientific article; zbMATH DE number 2080264 (Why is no real title available?)
• scientific article; zbMATH DE number 871936 (Why is no real title available?)
• scientific article; zbMATH DE number 2226805 (Why is no real title available?)
• Indexing compressed text
• Jewels of Stringology
• New text indexing functionalities of the compressed suffix arrays
• Practical compressed suffix trees
• Practical entropy-compressed rank/select dictionary
• Replacing suffix trees with enhanced suffix arrays
• String matching with alphabet sampling
• Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
• Suffix Arrays: A New Method for On-Line String Searches
• Time-space trade-offs for compressed suffix arrays.
• Wee LCP

Cited in

(8)

• Improved and extended locating functionality on compressed suffix arrays
• Faster repetition-aware compressed suffix trees based on block trees
• Compressed directed acyclic word graph with application in local alignment
• Fast matching statistics in small space
• A quick tour on suffix arrays and compressed suffix arrays
• Grammar Compression by Induced Suffix Sorting
• Relative Lempel-Ziv Compression of Suffix Arrays
• Rpair: rescaling RePair with Rsync

This page was built for publication: Locally compressed suffix arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828176)