An efficient, versatile approach to suffix sorting

DOI10.1145/1227161.1278374zbMath1365.68192OpenAlexW2032930944MaRDI QIDQ5269267

Michael A. Maniscalco, Simon J. Puglisi

Publication date: 15 June 2017

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

Full work available at URL: https://doi.org/10.1145/1227161.1278374

zbMATH Keywords

Burrows-Wheeler transformsuffix arraysuffix treesuffix sorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (3)

Faster semi-external suffix sorting ⋮ IN-PLACE UPDATE OF SUFFIX ARRAY WHILE RECODING WORDS ⋮ Inducing Suffix and LCP Arrays in External Memory

This page was built for publication: An efficient, versatile approach to suffix sorting