The greedy path-merging algorithm for contig scaffolding

DOI10.1145/585265.585267zbMath1326.92052OpenAlexW2083215220MaRDI QIDQ3455543

Knut Reinert, Eugene W. Myers, Daniel H. Huson

Publication date: 7 December 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/585265.585267

zbMATH Keywords

genome assembly

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Genetics and epigenetics (92D10)

Related Items (7)

Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding ⋮ Notes on the $$\frac{6}{5}$$ -Approximation Algorithm for One-Sided Scaffold Filling ⋮ A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling ⋮ Global optimization for scaffolding and completing genome assemblies ⋮ On the solution bound of two-sided scaffold filling ⋮ A complexity and approximation framework for the maximization scaffolding problem ⋮ A 1.5-approximation algorithm for two-sided scaffold filling

This page was built for publication: The greedy path-merging algorithm for contig scaffolding