In-Place Suffix Sorting

DOI10.1007/978-3-540-73420-8_47MaRDI QIDQ5428837zbMATH OpenOpenAlexFDO

Authors

Publication date 28 November 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73420-8_47

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• Optimal in-place suffix sorting
• Optimal in-place suffix sorting
• Faster suffix sorting
• In-place sparse suffix sorting
• Suffix-sorting via Shannon-Fano-Elias codes

Cited in

(17)

• Suffix-sorting via Shannon-Fano-Elias codes
• A Fast Suffix-Sorting Algorithm
• Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection
• Space-efficient construction of Lempel-Ziv compressed text indexes
• An efficient, versatile approach to suffix sorting
• Frameworks for designing in-place graph algorithms
• Computing the Burrows-Wheeler transform in place and in small space
• p-suffix sorting as arithmetic coding
• In-place sparse suffix sorting
• A framework for in-place graph algorithms
• Lightweight data indexing and compression in external memory
• In-place sorting with fewer moves
• Faster suffix sorting
• Optimal in-place suffix sorting
• Optimal in-place suffix sorting
• Optimal In-place Algorithms for Basic Graph Problems
• Burrows-Wheeler transform and LCP array construction in constant space

This page was built for publication: In-Place Suffix Sorting

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