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

DOI10.1007/978-3-662-48221-6_19MaRDI QIDQ5283832zbMATH OpenOpenAlexFDO

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

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)

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

Cited in

(7)

• RNA Secondary Structure Prediction Via Energy Density Minimization
• Sparse RNA Folding: Time and Space Efficient Algorithms
• SparseRNAFoID: sparse RNA pseudoknot-free folding including dangles
• scientific article; zbMATH DE number 7205101 (Why is no real title available?)
• 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
• 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)