Presentation
Exploring Suffix Array Algorithms in Chapel
DescriptionIn this project, we implemented algorithms to construct suffix arrays in Chapel, and used them to compute minimal unique substrings and similarity rankings. We developed these algorithms as building blocks for strain detection in metagenomic analysis. With Chapel, we were able to create parallel programs for each of these tasks in short order, and we are seeing good performance with minimal optimization.
Event Type
Workshop
TimeSunday, 17 November 20242:45pm - 3pm EST
LocationB306
Heterogeneous Computing
Parallel Programming Methods, Models, Languages and Environments
PAW-Abstract
Task Parallelism
W
Archive
view
