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

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.
parsimony haplotyping; computational biology; totally unimodular matrices; fixed parameter tractability; approximation algorithm
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.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11562/409570
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 34
  • ???jsp.display-item.citation.isi??? 27
social impact