New results for the longest haplotype reconstruction problem
type: Item
instance of: scholarly article
title: New results for the longest haplotype reconstruction problem
zbMATH Open document ID: 1260.92089
author: Riccardo Dondi
published in: Discrete Applied Mathematics
publication date: 2012-05-30T00:00:00Z
Mathematics Subject Classification ID: 92D10
Mathematics Subject Classification ID: 92-08
Mathematics Subject Classification ID: 92C40
zbMATH DE Number: 6039501
zbMATH Keywords: computational biology
zbMATH Keywords: approximation complexity
zbMATH Keywords: fixed-parameter algorithms
MaRDI profile type: Publication
full work available at URL: j.dam.2011.10.014
OpenAlex ID: W2072836445
cites work: Some APX-completeness results for cubic graphs
cites work: Color-coding
cites work: Proof verification and the hardness of approximation problems
cites work: Q4258216
cites work: The haplotyping problem: an overview of computational models and solutions
cites work: The complexity of the single individual SNP haplotyping problem
cites work: Q4503944
cites work: Opportunities for combinatorial optimization in computational biology
cites work: On the complexity of comparing evolutionary trees
cites work: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
cites work: On approximating the longest path in a graph
cites work: Q4796705
cites work: Q5710169
cites work: The complexity of satisfiability problems
DOI: 10.1016/J.DAM.2011.10.014
description: scientific article; zbMATH DE number 6039501