Engineering a lightweight external memory suffix array construction algorithm
From MaRDI portal
Publication:2363989
DOI10.1007/s11786-016-0281-1zbMath1377.68328OpenAlexW2402980768MaRDI QIDQ2363989
Juha Kärkkäinen, Dominik Kempa
Publication date: 17 July 2017
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-016-0281-1
Related Items
Faster average case low memory semi-external construction of the Burrows-Wheeler transform, Better External Memory LCP Array Construction, Unnamed Item, LCP Array Construction in External Memory, Faster Compressed Suffix Trees for Repetitive Collections, Space efficient merging of de Bruijn graphs and Wheeler graphs
Uses Software
Cites Work
- Unnamed Item
- Replacing suffix trees with enhanced suffix arrays
- String-matching on ordered alphabets
- Lightweight data indexing and compression in external memory
- Fast BWT in small space by blockwise suffix sorting
- Algorithms and Data Structures for External Memory
- New Lower and Upper Bounds for Representing Sequences
- Compressed representations of sequences and full-text indexes
- Alphabet Partitioning for Compressed Rank/Select and Applications
- Suffix Arrays: A New Method for On-Line String Searches
- Linear work suffix array construction
- Indexing compressed text
- Fast Pattern Matching in Strings
- External Memory Generalized Suffix and LCP Arrays Construction
- String Range Matching
- Inducing Suffix and LCP Arrays in External Memory
- LCP Array Construction in External Memory
- Better external memory suffix array construction
- A theoretical and experimental study on the construction of suffix arrays in external memory
