scientific article; zbMATH DE number 7205101

DOI10.4230/LIPICS.WABI.2017.12MaRDI QIDQ5111807zbMATH OpenFDO

Authors H. Jabbari, Ian Wark, Carlo D. Montemagno, Sebastian Will

Publication date 27 May 2020

zbMATH Keywords

RNAsparsificationpseudoknotsspace efficiencysecondary structure prediction

Mathematics Subject Classification ID

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

Recommendations

• A new method for prediction of RNA secondary structure with pseudoknots, based on helix removal and refinement
• Sparse RNA folding revisited: space-efficient minimum free energy prediction
• Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
• Computing and Combinatorics
• Prediction for RNA planar pseudoknots

Cites work

• A Study of Accessible Motifs and RNA Folding Complexity
• Automata, Languages and Programming
• Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots
• Sparse RNA folding revisited: space-efficient minimum free energy prediction
• Sparse RNA folding: time and space efficient algorithms
• Tree adjoining grammars for RNA structure prediction

Cited in

(2)

• SparseRNAFoID: sparse RNA pseudoknot-free folding including dangles
• Sparse RNA folding revisited: space-efficient minimum free energy prediction

Describes a project that uses

Uses Software

• IPknot
• GitHub

This page was built for publication:

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