Succinct suffix arrays based on run-length encoding

DOI10.1007/11496656_5MaRDI QIDQ5713568zbMATH OpenOpenAlexFDO

Authors Veli Mäkinen, Gonzalo Navarro

Publication date 14 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b137128

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 2230164
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
• A SIMPLE ALPHABET-INDEPENDENT FM-INDEX
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• scientific article; zbMATH DE number 2079421

Cited in

(28)

• Fixed block compression boosting in FM-indexes: theory and practice
• p-suffix sorting as arithmetic coding
• Flexible indexing of repetitive collections
• A framework for designing space-efficient dictionaries for parameterized and order-preserving matching
• Parallel lightweight wavelet tree, suffix array and FM-index construction
• Space-efficient substring occurrence estimation
• Improved characters distance sampling for online and offline text searching
• Deterministic Sparse Suffix Sorting on Rewritable Texts
• Composite repetition-aware data structures
• Counting Colours in Compressed Strings
• Succinct indexes for strings, binary relations and multilabeled trees
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• A SIMPLE ALPHABET-INDEPENDENT FM-INDEX
• scientific article; zbMATH DE number 7559178 (Why is no real title available?)
• Fully functional suffix trees and optimal text searching in BWT-runs bounded space
• Fast label extraction in the CDAWG
• Statistical Encoding of Succinct Data Structures
• String Processing and Information Retrieval
• Succinct backward-DAWG-matching
• scientific article; zbMATH DE number 2230164 (Why is no real title available?)
• scientific article; zbMATH DE number 7651154 (Why is no real title available?)
• Theory and Applications of Models of Computation
• Bit catastrophes for the Burrows-Wheeler transform
• Wheeler maps
• b-move: faster bidirectional character extensions in a run-length compressed index
• Solving the minimal positional substring cover problem in sublinear space
• Bit catastrophes for the Burrows-Wheeler transform
• Dynamic rank/select structures with applications to run-length encoded texts

This page was built for publication: Succinct suffix arrays based on run-length encoding

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