A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling

DOI10.1007/978-3-319-59605-1_18zbMath1492.92048OpenAlexW2730986728MaRDI QIDQ4632215

Jingjing Ma, Haitao Jiang, Shu Zhang, Daming Zhu

Publication date: 26 April 2019

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-59605-1_18

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Approximation algorithms (68W25)

Related Items (2)

A new approximation algorithm for contig-based genomic scaffold filling ⋮ On the solution bound of two-sided scaffold filling

Cites Work

• Unnamed Item
• A 1.5-approximation algorithm for two-sided scaffold filling
• Local optimality and its application on independent sets for \(k\)-claw free graphs
• Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies
• The greedy path-merging algorithm for contig scaffolding
• Notes on the $$\frac{6}{5}$$ -Approximation Algorithm for One-Sided Scaffold Filling
• An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies

This page was built for publication: A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling