Approximation and exact algorithms for RNA secondary structure prediction and recognition of stochastic context-free languages
From MaRDI portal
Publication:1306408
DOI10.1023/A:1009898029639zbMath0972.92012MaRDI QIDQ1306408
Publication date: 20 November 2001
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009898029639
computational biology; approximation algorithms; RNA secondary structure prediction; stochastic context-free grammar
90C90: Applications of mathematical programming
92C40: Biochemistry, molecular biology
65Y20: Complexity and performance of numerical algorithms
92-08: Computational methods for problems pertaining to biology
Related Items
Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product, Unnamed Item, A Sparsified Four-Russian Algorithm for RNA Folding, Fast RNA structure alignment for crossing input structures, Sparse RNA folding: time and space efficient algorithms, Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots, Hardness of RNA folding problem with four symbols, Edit Distance with Duplications and Contractions Revisited, Fast RNA Structure Alignment for Crossing Input Structures, Sparse RNA Folding: Time and Space Efficient Algorithms