Parallel suffix sorting for large string analytics

DOI10.1007/978-3-031-30442-2_6zbMath1529.68090OpenAlexW4367355557MaRDI QIDQ6135464

David A. Bader, Sen Zhang, Zhihui du

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

zbMATH Keywords

optimal algorithmparallel sortingsuffix arraystring analysisstring algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Engineering a lightweight suffix array construction algorithm
• Fast BWT in small space by blockwise suffix sorting
• Faster suffix sorting
• Space efficient linear time construction of suffix arrays
• Optimal in-place suffix sorting
• Suffix Arrays: A New Method for On-Line String Searches
• Linear work suffix array construction
• Fast Lightweight Suffix Array Construction and Checking
• Linear-Time Construction of Suffix Arrays
• A Space-Economical Suffix Tree Construction Algorithm
• Fast In-Place Suffix Sorting on a Multicore Computer
• Scalable Parallel Suffix Array Construction
• Power balance and apportionment algorithms for the United States Congress

This page was built for publication: Parallel suffix sorting for large string analytics