An elegant algorithm for the construction of suffix arrays
From MaRDI portal
Publication:2250537
DOI10.1016/j.jda.2014.03.001zbMath1361.68071arXiv1307.1417WikidataQ42147233 ScholiaQ42147233MaRDI QIDQ2250537
Sanguthevar Rajasekaran, Marius Nicolae
Publication date: 7 July 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.1417
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Special issue: Average-case analysis of algorithms
- Engineering a lightweight suffix array construction algorithm
- Faster suffix sorting
- Fast Lightweight Suffix Array Construction and Checking
- Linear-Time Construction of Suffix Arrays
- Space Efficient Linear Time Construction of Suffix Arrays
- Parallel Merge Sort
- Sorting on a mesh-connected parallel computer
- Optimal and Practical Algorithms for Sorting on the PDM