Speeding up the dynamic algorithm for planar RNA folding

DOI10.1016/0025-5564(90)90046-2MaRDI QIDQ912787zbMATH OpenOpenAlexWikidataFDO

Authors Ruth Nussinov, Shuyun Le, Jacob V. jun. Maizel, Bruce A. Shapiro

Publication date 1990

Published in Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0025-5564(90)90046-2

zbMATH Keywords

dynamic algorithmjumping proceduremaximum number of base pairs algorithmminimal energy algorithmmolecular biologyplanar RNA foldingRNA topologies

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Physiological, cellular and medical topics (92Cxx)

Recommendations

• scientific article; zbMATH DE number 4116366
• Rapid dynamic programming algorithms for RNA secondary structure
• Sparse RNA Folding: Time and Space Efficient Algorithms
• Computational Science – ICCS 2005
• An RNA folding algorithm based on dynamic weighted matching

Cites work

• Algorithms for Loop Matchings
• scientific article; zbMATH DE number 3675903 (Why is no real title available?)
• Rapid dynamic programming algorithms for RNA secondary structure
• RNA secondary structures and their prediction
• Simultaneous Solution of the RNA Folding, Alignment and Protosequence Problems
• The String-to-String Correction Problem

Cited in

(11)

• On finding all suboptimal foldings of an RNA molecule
• A Study of Accessible Motifs and RNA Folding Complexity
• Sparse RNA Folding: Time and Space Efficient Algorithms
• scientific article; zbMATH DE number 4116366 (Why is no real title available?)
• Efficient computation of RNA folding dynamics
• scientific article; zbMATH DE number 7559176 (Why is no real title available?)
• An IP algorithm for RNA folding trajectories
• The Bounded and Precise Word Problems for Presentations of Groups
• scientific article; zbMATH DE number 6411942 (Why is no real title available?)
• Sparse RNA folding: time and space efficient algorithms
• Variations on RNA folding and alignment: Lessons from Benasque

This page was built for publication: Speeding up the dynamic algorithm for planar RNA folding

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