The Algorithm for the Two-Sided Scaffold Filling Problem

DOI10.1007/978-3-642-38236-9_22zbMath1382.92193OpenAlexW2235820402MaRDI QIDQ4922130

Daming Zhu, Nan Liu

Publication date: 28 May 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38236-9_22

zbMATH Keywords

sequencingadjacenciesscaffold filling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10) Approximation algorithms (68W25)

Related Items (3)

Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem ⋮ Notes on the $$\frac{6}{5}$$ -Approximation Algorithm for One-Sided Scaffold Filling ⋮ A 1.5-approximation algorithm for two-sided scaffold filling

This page was built for publication: The Algorithm for the Two-Sided Scaffold Filling Problem