An efficient, versatile approach to suffix sorting

DOI10.1145/1227161.1278374MaRDI QIDQ5269267zbMATH OpenOpenAlexFDO

Authors 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 sortingsuffix tree

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)

Recommendations

• Faster suffix sorting
• A Fast Suffix-Sorting Algorithm
• In-Place Suffix Sorting
• Optimal in-place suffix sorting
• Parallel External Memory Suffix Sorting

Cited in

(13)

• p-suffix sorting as arithmetic coding
• An elegant algorithm for the construction of suffix arrays
• Faster semi-external suffix sorting
• Faster suffix sorting
• Deterministic Sparse Suffix Sorting on Rewritable Texts
• p-suffix sorting as arithmetic coding
• Fast string sorting using order-preserving compression
• In-place update of suffix array while recoding words
• On the number of elements to reorder when updating a suffix array
• Scalable Suffix Sorting on a Multicore Machine
• Inducing suffix and LCP arrays in external memory
• A Fast Suffix-Sorting Algorithm
• Formally verified suffix array construction

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

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