Better external memory suffix array construction

DOI10.1145/1227161.1402296zbMath1365.68178WikidataQ56485255 ScholiaQ56485255MaRDI QIDQ5269285

Juha Kärkkäinen, Roman Dementiev, Jens Mehnert, Peter Sanders

Publication date: 15 June 2017

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

Full work available at URL: https://publikationen.bibliothek.kit.edu/1000009446/496442

zbMATH Keywords

suffix array; external memory; large data sets; algorithm engineering; secondary memory; I/O-efficient; algorithms for strings

Mathematics Subject Classification ID

68P05: Data structures

68P20: Information storage and retrieval of data

Related Items

Better External Memory LCP Array Construction, Scalable Parallel Suffix Array Construction, Inducing Suffix and LCP Arrays in External Memory, LCP Array Construction in External Memory, Faster Compressed Suffix Trees for Repetitive Collections, Space-efficient construction of Lempel-Ziv compressed text indexes, Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays, Engineering a lightweight external memory suffix array construction algorithm, Faster average case low memory semi-external construction of the Burrows-Wheeler transform, Lightweight data indexing and compression in external memory, Fast BWT in small space by blockwise suffix sorting, Permuted Longest-Common-Prefix Array