An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies

DOI10.1007/978-3-642-38768-5_36zbMath1382.92192OpenAlexW1711809663MaRDI QIDQ4925255

Daming Zhu, Haitao Jiang, Binhai Zhu, Nan Liu

Publication date: 11 June 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-38768-5_36

zbMATH Keywords

matchingadjacenciesscaffold filling

Mathematics Subject Classification ID

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

Related Items (5)

Genomic Scaffold Filling: A Progress Report ⋮ Notes on the $$\frac{6}{5}$$ -Approximation Algorithm for One-Sided Scaffold Filling ⋮ A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling ⋮ A Retrospective on Genomic Preprocessing for Comparative Genomics ⋮ A 1.5-approximation algorithm for two-sided scaffold filling

This page was built for publication: An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies