scientific article; zbMATH DE number 7205101

DOI10.4230/LIPICS.WABI.2017.12zbMATH Open1443.92140MaRDI QIDQ5111807FDOQ5111807

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

Publication date: 27 May 2020

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

RNAsparsificationpseudoknotsspace efficiencysecondary structure prediction

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

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

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)