Speedup of RNA Pseudoknotted Secondary Structure Recurrence Computation with the Four-Russians Method

DOI10.1007/978-3-642-31770-5_16zbMath1370.68345OpenAlexW79355621MaRDI QIDQ3167360

Yelena Frid, Dan Gusfield

Publication date: 2 November 2012

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31770-5_16

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Related Items (3)

A Sparsified Four-Russian Algorithm for RNA Folding ⋮ Hardness of RNA folding problem with four symbols ⋮ Unnamed Item

This page was built for publication: Speedup of RNA Pseudoknotted Secondary Structure Recurrence Computation with the Four-Russians Method