The algorithm for the two-sided scaffold filling problem

DOI10.1007/978-3-642-38236-9_22MaRDI QIDQ4922130zbMATH OpenOpenAlexFDO

Authors Nan Liu, Daming Zhu

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

adjacenciesscaffold fillingsequencing

Mathematics Subject Classification ID

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

Recommendations

• An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies
• A 1.5-approximation algorithm for two-sided scaffold filling
• Approximation and nonapproximability for the one-sided scaffold filling problem
• A 1.4-approximation algorithm for two-sided scaffold filling
• Genomic scaffold filling revisited

Cited in

(9)

• On the solution bound of two-sided scaffold filling
• Fixed-parameter algorithms for scaffold filling
• A 1.5-approximation algorithm for two-sided scaffold filling
• Gap filling as exact path length problem
• Fixed-parameter algorithms for 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
• A 1.4-approximation algorithm for two-sided scaffold filling
• An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies

This page was built for publication: The algorithm for the two-sided scaffold filling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922130)