On the approximability of the simplified partial digest problem
type: Item
instance of: scholarly article
title: On the approximability of the simplified partial digest problem
zbMATH Open document ID: 1229.90282
author: Marta Kasprzak
author: Alexandr Kovalev
author: M. Y. Kovalyov
author: Jacek Blazewicz
author: Edmund K. Burke
published in: Discrete Applied Mathematics
publication date: 2010-04-28T00:00:00Z
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5702672
zbMATH Keywords: genome mapping
zbMATH Keywords: simplified partial digest problem
zbMATH Keywords: computational complexity
zbMATH Keywords: approximation
MaRDI profile type: Publication
full work available at URL: j.dam.2009.04.017
OpenAlex ID: W2064776523
Wikidata QID: Q57387743
cites work: Q4258216
cites work: The simplified partial digest problem: approximation and a graph-theoretic model
cites work: Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem
cites work: LATIN 2004: Theoretical Informatics
cites work: Some necessary clarifications about the chords' problem and the partial digest problem
cites work: Q4198056
cites work: The NP-completeness column: An ongoing guide
cites work: Q4526776
cites work: Q5692717
cites work: A partial digest approach to restriction site mapping
cites work: Q4315008
DOI: 10.1016/J.DAM.2009.04.017
DBLP publication ID: journals/dam/BlazewiczBKKK09
description: scientific article; zbMATH DE number 5702672