When indexing equals compression, experiments with compressing suffix arrays and applications
DOI10.1145/1198513.1198521zbMATH Open1430.68099OpenAlexW1969046465MaRDI QIDQ2944533FDOQ2944533
Authors: Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter 
Publication date: 2 September 2015
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1198513.1198521
Recommendations
- scientific article; zbMATH DE number 6469201
- scientific article; zbMATH DE number 2079421
- New text indexing functionalities of the compressed suffix arrays
- 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)
Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cited In (22)
- On undetected redundancy in the Burrows-Wheeler transform
- Title not available (Why is that?)
- Title not available (Why is that?)
- Adaptive succinctness
- Adaptive succinctness
- Move-to-front, distance coding, and inversion frequencies revisited
- Title not available (Why is that?)
- An experimental study of a compressed index
- A compressed text index on secondary memory
- Relative Lempel-Ziv Compression of Suffix Arrays
- Rank/select on dynamic compressed sequences and applications
- Rank and select revisited and extended
- Locally compressed suffix arrays
- Indexing a sequence for mapping reads with a single mismatch
- Computation of the suffix array, Burrows-Wheeler transform and FM-index in \(V\)-order
- The myriad virtues of wavelet trees
- Compressed spaced suffix arrays
- Comparison between text compression algorithms in biological sequences
- Improved parallel construction of wavelet trees and rank/select structures
- New text indexing functionalities of the compressed suffix arrays
- Suffix Arrays on Words
- Hybrid indexing revisited
This page was built for publication: When indexing equals compression, experiments with compressing suffix arrays and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944533)
