Better external memory suffix array construction

DOI10.1145/1227161.1402296zbMath1365.68178OpenAlexW2077333702WikidataQ56485255 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 arrayexternal memorylarge data setsalgorithm engineeringsecondary memoryI/O-efficientalgorithms for strings

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (12)

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 ⋮ Better External Memory LCP Array Construction ⋮ Fast BWT in small space by blockwise suffix sorting ⋮ Scalable Parallel Suffix Array Construction ⋮ 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 ⋮ Permuted Longest-Common-Prefix Array ⋮ Inducing Suffix and LCP Arrays in External Memory ⋮ LCP Array Construction in External Memory ⋮ Faster Compressed Suffix Trees for Repetitive Collections

This page was built for publication: Better external memory suffix array construction