The phasing of heterozygous traits: Algorithms and complexity
type: Item
instance of: scholarly article
title: The phasing of heterozygous traits: Algorithms and complexity
zbMATH Open document ID: 1137.92024
author: Giuseppe Lancia
publication date: 2008-06-12T00:00:00Z
Mathematics Subject Classification ID: 92D10
Mathematics Subject Classification ID: 05A99
Mathematics Subject Classification ID: 92-08
Mathematics Subject Classification ID: 92D15
zbMATH DE Number: 5288059
zbMATH Keywords: computational biology
zbMATH Keywords: pure parsimony haplotyping
zbMATH Keywords: perfect phylogeny haplotyping
zbMATH Keywords: Clark's rule
MaRDI profile type: Publication
full work available at URL: j.camwa.2006.12.089
OpenAlex ID: W2020601866
cites work: Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms
cites work: Q4165387
cites work: Q4258216
cites work: A polynomial case of the parsimony haplotyping problem
cites work: Computational Methods for SNPs and Haplotype Inference
cites work: Research in Computational Molecular Biology
cites work: Opportunities for combinatorial optimization in computational biology
DOI: 10.1016/J.CAMWA.2006.12.089
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 5288059