Producing genomic sequences after genome scaffolding with ambiguous paths: complexity, approximation and lower bounds
type: Item
instance of: scholarly article
title: Producing genomic sequences after genome scaffolding with ambiguous paths: complexity, approximation and lower bounds
author: Tom Davot
author: Rodolphe Giroudeau
author: Mathias Weller
author: Dorine Tabary
author: Annie Chateau
published in: Algorithmica
publication date: 2021-06-30T00:00:00Z
full work available at URL: main llncs.pdf
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7365271
describes a project that uses: SOPRA
describes a project that uses: SCARPA
describes a project that uses: GRASS
describes a project that uses: Velvet
describes a project that uses: BESST
describes a project that uses: ScaffMatch
describes a project that uses: Bambus 2
MaRDI profile type: Publication
OpenAlex ID: W3158374272
cites work: OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
cites work: A complexity and approximation framework for the maximization scaffolding problem
cites work: On the hardness of approximating minimum vertex cover
cites work: Q4198056
cites work: Some optimal inapproximability results
cites work: Which problems have strongly exponential complexity?
cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
cites work: Optimization, approximation, and complexity classes
cites work: New results about the linearization of scaffolds sharing repeated contigs
cites work: On the linearization of scaffolds sharing repeated contigs
DOI: 10.1007/S00453-021-00819-6
description: scientific article; zbMATH DE number 7365271