Sparse RNA folding revisited: space-efficient minimum free energy prediction

DOI10.1007/978-3-662-48221-6_19zbMATH Open1367.92090OpenAlexW2223648683MaRDI QIDQ5283832FDOQ5283832

Authors: Sebastian Will, H. Jabbari 

Publication date: 25 July 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48221-6_19

Recommendations

• Sparse RNA Folding: Time and Space Efficient Algorithms
• Sparse RNA folding: time and space efficient algorithms
• A sparsified Four-Russian algorithm for RNA folding
• scientific article; zbMATH DE number 7205101
• RNA secondary structures in a polymer-zeta model how foldings should be shaped for sparsification to establish a linear speedup

zbMATH Keywords

RNA secondary structure predictionpseudoknot-free RNA foldingspace efficient sparsification

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08)

Cited In (7)

• Sparse RNA folding: time and space efficient algorithms
• Title not available (Why is that?)
• RNA secondary structures in a polymer-zeta model how foldings should be shaped for sparsification to establish a linear speedup
• A sparsified Four-Russian algorithm for RNA folding
• RNA Secondary Structure Prediction Via Energy Density Minimization
• SparseRNAFoID: sparse RNA pseudoknot-free folding including dangles
• Sparse RNA Folding: Time and Space Efficient Algorithms

This page was built for publication: Sparse RNA folding revisited: space-efficient minimum free energy prediction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283832)