A new approximation algorithm for the maximum stacking base pairs problem from RNA secondary structures prediction
From MaRDI portal
Publication:1699765
DOI10.1007/978-3-319-71150-8_7zbMATH Open1470.68239OpenAlexW2768884138MaRDI QIDQ1699765FDOQ1699765
Authors: Aizhong Zhou, Haitao Jiang, Jiong Guo, Daming Zhu 
Publication date: 26 February 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-71150-8_7
Recommendations
- Improved approximation algorithm for the maximum base pair stackings problem in RNA secondary structures prediction
- Computational Science – ICCS 2005
- Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
- An optimized and efficiently parallelized dynamic programming for RNA secondary structure prediction
- A parallel algorithm for estimating the secondary structure in ribonucleic acids
- Rapid dynamic programming algorithms for RNA secondary structure
- Approximation algorithms for the maximum multiple RNA interaction problem
- Publication:4731051
Protein sequences, DNA sequences (92D20) Approximation algorithms (68W25) Algorithms on strings (68W32)
Cited In (4)
- Improved approximation algorithm for the maximum base pair stackings problem in RNA secondary structures prediction
- New approximation algorithms for RNA secondary structures prediction problems by local search
- Approximating the maximum multiple RNA interaction problem
- Approximation algorithms for the maximum multiple RNA interaction problem
This page was built for publication: A new approximation algorithm for the maximum stacking base pairs problem from RNA secondary structures prediction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1699765)
