Parallel suffix sorting for large string analytics
From MaRDI portal
Publication:6135464
DOI10.1007/978-3-031-30442-2_6zbMATH Open1529.68090OpenAlexW4367355557MaRDI QIDQ6135464FDOQ6135464
Authors: Zhihui Du, Sen Zhang, David A. Bader
Publication date: 25 August 2023
Published in: Parallel Processing and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30442-2_6
Recommendations
Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)
Cites Work
- Linear work suffix array construction
- Suffix Arrays: A New Method for On-Line String Searches
- Title not available (Why is that?)
- A Space-Economical Suffix Tree Construction Algorithm
- Space efficient linear time construction of suffix arrays
- Title not available (Why is that?)
- Fast BWT in small space by blockwise suffix sorting
- Linear-time construction of suffix arrays (extended abstract)
- Scalable Parallel Suffix Array Construction
- Engineering a lightweight suffix array construction algorithm
- Fast lightweight suffix array construction and checking
- Faster suffix sorting
- Power balance and apportionment algorithms for the United States Congress
- Optimal in-place suffix sorting
- Fast In-Place Suffix Sorting on a Multicore Computer
Cited In (4)
This page was built for publication: Parallel suffix sorting for large string analytics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135464)