A Fast Suffix-Sorting Algorithm

DOI10.1007/11889342_46zbMATH Open1158.68365OpenAlexW2021175706MaRDI QIDQ5504223

Christian Deppe, Manuel Fröhlich, Bernhard Balkenhol, 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)

Related Items (1)

A fast algorithm for the all-pairs suffix-prefix problem

Recommendations

• An elegant algorithm for the construction of suffix arrays 👍 👎
• Faster semi-external suffix sorting 👍 👎
• Faster suffix sorting 👍 👎
• Optimal in-place suffix sorting 👍 👎
• Faster Sparse Suffix Sorting 👍 👎
• Fast In-Place Suffix Sorting on a Multicore Computer 👍 👎
• An efficient, versatile approach to suffix sorting 👍 👎
• In-Place Suffix Sorting 👍 👎
• Optimal in-place 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)