A Sparsified Four-Russian Algorithm for RNA Folding

DOI10.1007/978-3-662-48221-6_20zbMath1367.92088OpenAlexW2238936896MaRDI QIDQ5283833

Yelena Frid, Dan Gusfield

Publication date: 25 July 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48221-6_20

zbMATH Keywords

Four-Russian algorithmsecondary structure prediction problem

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Sparse RNA folding: time and space efficient algorithms
• RNA secondary structures and their prediction
• RNA secondary structure: a complete mathematical analysis
• Approximation and exact algorithms for RNA secondary structure prediction and recognition of stochastic context-free languages
• Speedup of RNA Pseudoknotted Secondary Structure Recurrence Computation with the Four-Russians Method
• Sparse RNA Folding: Time and Space Efficient Algorithms
• Algorithms for Loop Matchings
• Biological Sequence Analysis
• Faster all-pairs shortest paths via circuit complexity
• Speeding up the Four Russians Algorithm by About One More Logarithmic Factor

This page was built for publication: A Sparsified Four-Russian Algorithm for RNA Folding