Approximating the maximum multiple RNA interaction problem

DOI10.1016/J.TCS.2014.04.018zbMath1339.92067OpenAlexW2003841667MaRDI QIDQ300233

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

Publication date: 27 June 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.04.018

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 (2)

Gibbs/MCMC Sampling for Multiple RNA Interaction with Sub-optimal Solutions ⋮ The band collocation problem

Cites Work

• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximating the maximum multiple RNA interaction problem