Better approximation algorithms for scaffolding problems
From MaRDI portal
Recommendations
- Approximation algorithms for the scaffolding problem and its generalizations
- New polynomial-time algorithm around the scaffolding problem
- A complexity and approximation framework for the maximization scaffolding problem
- Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases
- On the complexity of scaffolding problems: from cliques to sparse graphs
Cites work
Cited in
(8)- Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases
- Global optimization for scaffolding and completing genome assemblies
- New polynomial-time algorithm around the scaffolding problem
- A complexity and approximation framework for the maximization scaffolding problem
- Approximation algorithms for the scaffolding problem and its generalizations
- Instance guaranteed ratio on greedy heuristic for genome scaffolding
- The greedy path-merging algorithm for contig scaffolding
- An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies
This page was built for publication: Better approximation algorithms for scaffolding problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632165)