Pages that link to "Item:Q3455543"
From MaRDI portal
The following pages link to The greedy path-merging algorithm for contig scaffolding (Q3455543):
Displaying 7 items.
- A 1.5-approximation algorithm for two-sided scaffold filling (Q261348) (← links)
- Global optimization for scaffolding and completing genome assemblies (Q1742221) (← links)
- On the solution bound of two-sided scaffold filling (Q2034400) (← links)
- A complexity and approximation framework for the maximization scaffolding problem (Q2354768) (← links)
- Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding (Q2958322) (← links)
- Notes on the $$\frac{6}{5}$$ -Approximation Algorithm for One-Sided Scaffold Filling (Q4632180) (← links)
- A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling (Q4632215) (← links)
