A 1.4-approximation algorithm for two-sided scaffold filling
From MaRDI portal
Recommendations
- A 1.5-approximation algorithm for two-sided scaffold filling
- On the solution bound of two-sided scaffold filling
- Approximation and nonapproximability for the one-sided scaffold filling problem
- The algorithm for the two-sided scaffold filling problem
- An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies
Cites work
- A 1.5-approximation algorithm for two-sided scaffold filling
- An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies
- Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies
- scientific article; zbMATH DE number 910871 (Why is no real title available?)
- Local optimality and its application on independent sets for \(k\)-claw free graphs
- Notes on the $$\frac{6}{5}$$ -Approximation Algorithm for One-Sided Scaffold Filling
- The greedy path-merging algorithm for contig scaffolding
Cited in
(8)- On the solution bound of two-sided scaffold filling
- A new approximation algorithm for contig-based genomic scaffold filling
- A 1.5-approximation algorithm for two-sided scaffold filling
- Approximation and nonapproximability for the one-sided scaffold filling problem
- Notes on the \(\frac{6}{5}\)-approximation algorithm for one-sided scaffold filling
- The algorithm for the two-sided scaffold filling problem
- An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies
- A 2.57-approximation algorithm for contig-based genomic scaffold filling
This page was built for publication: A 1.4-approximation algorithm for two-sided scaffold filling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632215)