A Fast Suffix-Sorting Algorithm

DOI10.1007/11889342_46MaRDI QIDQ5504223zbMATH OpenOpenAlexFDO

Authors Bernhard Balkenhol, Christian Deppe, Manuel Fröhlich, Rudolf Ahlswede

Publication date 22 January 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11889342_46

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

• An efficient, versatile approach to suffix sorting
• Faster suffix sorting
• Faster semi-external suffix sorting
• Faster sparse suffix sorting
• Optimal in-place suffix sorting
• Optimal in-place suffix sorting
• In-Place Suffix Sorting
• An elegant algorithm for the construction of suffix arrays
• Fast In-Place Suffix Sorting on a Multicore Computer

Cited in

(5)

• A fast algorithm for the all-pairs suffix-prefix problem
• Faster suffix sorting
• Fast string sorting using order-preserving compression
• Lexical Permutation Sorting Algorithm
• An efficient, versatile approach to suffix sorting

This page was built for publication: A Fast Suffix-Sorting Algorithm

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