Approximation and exact algorithms for RNA secondary structure prediction and recognition of stochastic context-free languages
From MaRDI portal
Publication:1306408
Recommendations
- scientific article; zbMATH DE number 1303033
- Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots
- Rapid dynamic programming algorithms for RNA secondary structure
- Applying length-dependent stochastic context-free grammars to RNA secondary structure prediction
- Computational Science – ICCS 2005
Cited in
(14)- scientific article; zbMATH DE number 7559176 (Why is no real title available?)
- Fast RNA structure alignment for crossing input structures
- Sparse RNA folding: time and space efficient algorithms
- Algebraic dynamic programming for multiple context-free grammars
- A sparsified Four-Russian algorithm for RNA folding
- Extending stochastic context-free grammars for an application in bioinformatics
- Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots
- Fast RNA Structure Alignment for Crossing Input Structures
- Sparse RNA Folding: Time and Space Efficient Algorithms
- Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product
- Applying length-dependent stochastic context-free grammars to RNA secondary structure prediction
- Hardness of RNA folding problem with four symbols
- The Viterbi algorithm for subsets of stochastic context-free languages
- Edit distance with duplications and contractions revisited
This page was built for publication: Approximation and exact algorithms for RNA secondary structure prediction and recognition of stochastic context-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306408)