Speeding up the dynamic algorithm for planar RNA folding

DOI10.1016/0025-5564(90)90046-2zbMath0698.92012OpenAlexW1989052658WikidataQ47640332 ScholiaQ47640332MaRDI QIDQ912787

Jacob V. jun. Maizel, Ruth Nussinov, Shuyun Le, 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

molecular biologydynamic algorithmjumping proceduremaximum number of base pairs algorithmminimal energy algorithmplanar RNA foldingRNA topologies

Mathematics Subject Classification ID

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

Related Items

The Bounded and Precise Word Problems for Presentations of Groups

Cites Work

• RNA secondary structures and their prediction
• Rapid dynamic programming algorithms for RNA secondary structure
• Simultaneous Solution of the RNA Folding, Alignment and Protosequence Problems
• Algorithms for Loop Matchings
• The String-to-String Correction Problem
• Unnamed Item