Parallel suffix sorting for large string analytics
From MaRDI portal
Publication:6135464
Recommendations
Cites work
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 2038766 (Why is no real title available?)
- A Space-Economical Suffix Tree Construction Algorithm
- Engineering a lightweight suffix array construction algorithm
- Fast BWT in small space by blockwise suffix sorting
- Fast In-Place Suffix Sorting on a Multicore Computer
- Fast lightweight suffix array construction and checking
- Faster suffix sorting
- Linear work suffix array construction
- Linear-time construction of suffix arrays (extended abstract)
- Optimal in-place suffix sorting
- Power balance and apportionment algorithms for the United States Congress
- Scalable Parallel Suffix Array Construction
- Space efficient linear time construction of suffix arrays
- Suffix Arrays: A New Method for On-Line String Searches
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)