Faster suffix sorting

DOI10.1016/j.tcs.2007.07.017zbMath1144.68022MaRDI QIDQ2465058

Kunihiko Sadakane, N. Jesper Larsson

Publication date: 19 December 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.07.017

zbMATH Keywords

Burrows-Wheeler transform; suffix arrays

Mathematics Subject Classification ID

68P10: Searching and sorting

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

Related Items

Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays, GAME: A simple and efficient whole genome alignment method using maximal exact match filtering, Space efficient linear time construction of suffix arrays, A Fast Suffix-Sorting Algorithm

Uses Software

• Quicksort

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding the median
• Engineering a lightweight suffix array construction algorithm
• Suffix Arrays: A New Method for On-Line String Searches
• An analysis of the Burrows—Wheeler transform
• Linear work suffix array construction
• Indexing compressed text
• Fast Lightweight Suffix Array Construction and Checking
• Linear-Time Construction of Suffix Arrays
• Space Efficient Linear Time Construction of Suffix Arrays
• Algorithms and Computation
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
• Quicksort