Approximation and exact algorithms for RNA secondary structure prediction and recognition of stochastic context-free languages

DOI10.1023/A:1009898029639zbMath0972.92012OpenAlexW1725742266MaRDI QIDQ1306408

Tatsuya Akutsu

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

zbMATH Keywords

computational biologyapproximation algorithmsRNA secondary structure predictionstochastic context-free grammar

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Biochemistry, molecular biology (92C40) Complexity and performance of numerical algorithms (65Y20) Computational methods for problems pertaining to biology (92-08)

Related Items (10)

A Sparsified Four-Russian Algorithm for RNA Folding ⋮ Hardness of RNA folding problem with four symbols ⋮ Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product ⋮ Edit Distance with Duplications and Contractions Revisited ⋮ Fast RNA structure alignment for crossing input structures ⋮ Sparse RNA folding: time and space efficient algorithms ⋮ Unnamed Item ⋮ 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

This page was built for publication: Approximation and exact algorithms for RNA secondary structure prediction and recognition of stochastic context-free languages