An RNA folding algorithm including pseudoknots based on dynamic weighted matching
From MaRDI portal
Recommendations
Cited in
(7)- Prediction for RNA planar pseudoknots
- Speedup of RNA pseudoknotted secondary structure recurrence computation with the four-Russians method
- An RNA folding algorithm based on dynamic weighted matching
- RNA secondary structure prediction algorithm based on fast dynamic weighted matching
- Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
- Computing and Combinatorics
- Automated design of dynamic programming schemes for RNA folding with pseudoknots
This page was built for publication: An RNA folding algorithm including pseudoknots based on dynamic weighted matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490526)