Impact of the Energy Model on the Complexity of RNA Folding with Pseudoknots

DOI10.1007/978-3-642-31265-6_26zbMath1358.68347OpenAlexW82106056WikidataQ57221074 ScholiaQ57221074MaRDI QIDQ2904506

Rolf Backofen, Yann Ponty, Saad Sheikh

Publication date: 14 August 2012

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31265-6_26

zbMATH Keywords

hardnessinapproximabilityRNA foldinggeneral pseudoknots

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Algorithms on strings (68W32)

Related Items (3)

Approximation algorithms for maximum weight k-coverings of graphs by packings ⋮ Pseudoknot-generating operation ⋮ Combinatorics of locally optimal RNA secondary structures

This page was built for publication: Impact of the Energy Model on the Complexity of RNA Folding with Pseudoknots