Passer à la navigation principale Passer à la recherche Passer au contenu principal

Spark: Sparsified Hierarchical Energy Minimization of RNA Pseudoknots

  • University of Alberta

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collectionContribution à une conférenceRevue par des pairs

Résumé

Motivation. Determining RNA structure is essential for understanding RNA function and interaction networks. Although experimental techniques yield high-accuracy structures, they are costly and time-consuming; thus, computational approaches – especially minimum-free-energy (MFE) prediction algorithms – are indispensable. Accurately predicting pseudoknots, however, remains challenging because their inclusion usually leads to prohibitive computational complexity. Recent work demonstrated that sparsification can improve the efficiency of complex pseudoknot prediction algorithms such as Knotty. This finding suggests similar gains are possible for already efficient algorithms like HFold, which targets a complementary class of hierarchically constrained pseudoknots. Results. We introduce Spark, an exact, fully sparsified algorithm for predicting pseudoknotted RNA structures. Like its non-sparsified predecessor HFold, Spark searches for the minimum-energy structure under the HotKots 2.0 energy model, a pseudoknot extension of the Turner model. Because the sparsification is non-heuristic, Spark preserves the asymptotic time- and space-complexity guarantees of HFold while greatly reducing the constant factors. We benchmarked the performance of Spark against HFold and, as a pseudoknot-free baseline, RNAfold. Compared with HFold, Spark substantially lowers both run time and memory usage, while achieving run-time figures close to those of RNAfold. Across all tested sequence lengths, Spark used the least memory and consistently ran faster than HFold. Conclusion. By extending non-heuristic sparsification to hierarchical pseudoknot prediction, Spark delivers an exceptionally fast and memory-efficient tool accurate prediction of pseudoknotted RNA structures, enabling routine analysis of long sequences. The algorithm broadens the practical scope of computational RNA biology and provides a solid foundation for future advances in structure-based functional annotation. Availability. Spark’s implementation and detailed results are available at https://github.com/TheCOBRALab/Spark.

langue originaleAnglais
titre25th International Conference on Algorithms for Bioinformatics, WABI 2025
rédacteurs en chefBrona Brejova, Rob Patro
EditeurSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronique)9783959773867
Les DOIs
étatPublié - 15 août 2025
Evénement25th International Conference on Algorithms for Bioinformatics, WABI 2025 - College Park, États-Unis
Durée: 20 août 202522 août 2025

Série de publications

NomLeibniz International Proceedings in Informatics, LIPIcs
Volume344
ISSN (imprimé)1868-8969

Une conférence

Une conférence25th International Conference on Algorithms for Bioinformatics, WABI 2025
Pays/TerritoireÉtats-Unis
La villeCollege Park
période20/08/2522/08/25

Empreinte digitale

Examiner les sujets de recherche de « Spark: Sparsified Hierarchical Energy Minimization of RNA Pseudoknots ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation