Cache-efficient and vectorized parallel dynamic programming for RNA folding
Mateusz Gruzewski, Marek Palkowski · 2026
Read Cache-efficient and vectorized parallel dynamic programming for RNA folding by Mateusz Gruzewski, Marek Palkowski (2026) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/plos-pone-0349146.txt.
Description
Mateusz Gruzewski and Marek Palkowski wrote a fast computer program for predicting how an RNA molecule folds, a classic problem in computational biology. Their code implements the Nussinov algorithm, which finds the fold with the most paired bases, a task whose cost explodes as sequences grow. The trick is reorganizing the calculation so modern processors can use their memory caches and many cores well.
By splitting easy and hard cases and arranging the work like matrix multiplication, the code vectorizes cleanly and scales across very large thread counts on both major processor brands. It beat compiler-generated versions in tests. Folding speed is a bottleneck in RNA research, so a reusable, well-tuned template helps every related algorithm.
Catalog record
| CREATOR | Mateusz Gruzewski, Marek Palkowski |
|---|---|
| YEAR | 2026 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 47590 |
| LICENSE | CC_BY |
| RIGHTS | CC BY |
| SOURCE | PLOS |