The parsimony haplotyping problem was shown to be NP-hard when each genotype had k <= 3 ambiguous positions, while the case for k <= 2 was open. In this paper, we show that the case for k <= 2 is polynomial. and we give approximation and FPT algorithms for the general case of k >= 0 ambiguous positions.
A polynomial case of the parsimony haplotyping problem
RIZZI, ROMEO
2006-01-01
Abstract
The parsimony haplotyping problem was shown to be NP-hard when each genotype had k <= 3 ambiguous positions, while the case for k <= 2 was open. In this paper, we show that the case for k <= 2 is polynomial. and we give approximation and FPT algorithms for the general case of k >= 0 ambiguous positions.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
