Pages that link to "Item:Q1635706"
From MaRDI portal
The following pages link to Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases (Q1635706):
Displaying 7 items.
- On the linearization of scaffolds sharing repeated contigs (Q1708649) (← links)
- Producing genomic sequences after genome scaffolding with ambiguous paths: complexity, approximation and lower bounds (Q2037107) (← links)
- A complexity and approximation framework for the maximization scaffolding problem (Q2354768) (← links)
- Approximation algorithms for the scaffolding problem and its generalizations (Q2636507) (← links)
- Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding (Q2958322) (← links)
- Linearizing Genomes: Exact Methods and Local Search (Q3297780) (← links)
- An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies (Q4925255) (← links)