Faster semi-external suffix sorting

DOI10.1016/J.IPL.2013.11.017MaRDI QIDQ2445902zbMATH OpenOpenAlexFDO

Authors Jasbir Dhaliwal

Publication date 15 April 2014

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2013.11.017

zbMATH Keywords

data structuresstring algorithmssuffix arrayBurrows-Wheeler transform

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Algorithms on strings (68W32)

Recommendations

• Engineering a lightweight external memory suffix array construction algorithm
• Parallel External Memory Suffix Sorting
• Faster External Memory LCP Array Construction
• Faster suffix sorting
• Engineering External Memory Induced Suffix Sorting

Cites work

• scientific article; zbMATH DE number 6472611 (Why is no real title available?)
• An efficient, versatile approach to suffix sorting
• Compressed representations of sequences and full-text indexes
• Fast BWT in small space by blockwise suffix sorting
• Fast and Practical Algorithms for Computing All the Runs in a String
• Fast lightweight suffix array construction and checking
• Lightweight data indexing and compression in external memory
• Space efficient linear time construction of suffix arrays
• Space-Time Tradeoffs for Longest-Common-Prefix Array Computation

Cited in

(2)

• A Fast Suffix-Sorting Algorithm
• Parallel External Memory Suffix Sorting

This page was built for publication: Faster semi-external suffix sorting

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