Approximating the maximum multiple RNA interaction problem
From MaRDI portal
Recommendations
- Approximation algorithms for the maximum multiple RNA interaction problem
- A combinatorial approach for multiple RNA interaction: formulations, approximations, and heuristics
- Making multiple RNA interaction practical
- Improved approximation algorithm for the maximum base pair stackings problem in RNA secondary structures prediction
- A new approximation algorithm for the maximum stacking base pairs problem from RNA secondary structures prediction
Cites work
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
- A combinatorial approach for multiple RNA interaction: formulations, approximations, and heuristics
- An improved approximation algorithm for the bandpass-2 problem
- On the bandpass problem
- Research in Computational Molecular Biology
Cited in
(9)- A combinatorial approach for multiple RNA interaction: formulations, approximations, and heuristics
- Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks
- Approximation algorithms for the maximum multiple RNA interaction problem
- Improved approximation algorithm for the maximum base pair stackings problem in RNA secondary structures prediction
- Making multiple RNA interaction practical
- The band collocation problem
- Gibbs/MCMC sampling for multiple RNA interaction with sub-optimal solutions
- Tabu search for the RNA partial degradation problem
- scientific article; zbMATH DE number 910876 (Why is no real title available?)
This page was built for publication: Approximating the maximum multiple RNA interaction problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300233)