Approximation Algorithms for the Maximum Multiple RNA Interaction Problem

DOI10.1007/978-3-319-03780-6_5zbMath1339.92066OpenAlexW53859920MaRDI QIDQ2867107

Randy Goebel, Guo-Hui Lin, Tian Liu, Weitian Tong

Publication date: 10 December 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-319-03780-6_5

zbMATH Keywords

approximation algorithmacyclic 2-matchingmaximum weight \(b\)-matchingRNA interactionworst case performance ratio

Mathematics Subject Classification ID

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

Related Items (1)

Gibbs/MCMC Sampling for Multiple RNA Interaction with Sub-optimal Solutions

Cites Work

• Unnamed Item
• On the bandpass problem
• An Improved Approximation Algorithm for the Bandpass-2 Problem
• A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
• A Combinatorial Approach for Multiple RNA Interaction: Formulations, Approximations, and Heuristics
• Research in Computational Molecular Biology

This page was built for publication: Approximation Algorithms for the Maximum Multiple RNA Interaction Problem