On the complexity of SNP block partitioning under the perfect phylogeny model
type: Item
instance of: scholarly article
title: On the complexity of SNP block partitioning under the perfect phylogeny model
zbMATH Open document ID: 1181.92030
author: Jens Gramm
author: Tzvika Hartman
author: Till Nierhoff
author: Roded Sharan
author: Till Tantau
published in: Discrete Mathematics
publication date: 2009-12-15T00:00:00Z
Mathematics Subject Classification ID: 92C42
Mathematics Subject Classification ID: 92D15
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 92D10
zbMATH DE Number: 5648098
zbMATH Keywords: perfect phylogeny haplotyping
zbMATH Keywords: perfect path phylogeny
zbMATH Keywords: partitioning problems
MaRDI profile type: Publication
full work available at URL: j.disc.2008.04.002
OpenAlex ID: W2154651106
cites work: Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers
cites work: The hardness of 3-uniform hypergraph coloring
cites work: Recognition algorithms for orders of small width and graphs of small Dilworth number
cites work: Q4198056
cites work: Haplotyping with missing data via perfect path phylogenies
cites work: Parameterized and Exact Computation
cites work: Efficient algorithms for inferring evolutionary trees
cites work: On the hardness of approximating minimization problems
cites work: Q4370201
DOI: 10.1016/J.DISC.2008.04.002
description: scientific article; zbMATH DE number 5648098