On the complexity of SNP block partitioning under the perfect phylogeny model☆
Under an Elsevier user license
open archive
Keywords
Perfect phylogeny haplotyping
Perfect path phylogeny
Partitioning problems
Cited by (0)
- ☆
A preliminary version of this paper appeared in [Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau, On the complexity of SNP block partitioning under the perfect phylogeny model, in: Proc. of the sixth Workshop on Algorithms in Bioinformatics, WABI’06, 2006, pp. 92–102].
Copyright © 2008 Elsevier B.V. All rights reserved.