Haplotype Inferring Via Galled-Tree Networks Is NP-Complete

The problem of determining haplotypes from genotypes has gained considerable prominence in the research community since the beginning of the HapMap project. Here the focus is on determining the sets of SNP values of individual chromosomes (haplotypes), since such information better captures the genetic causes of diseases. One of the main algorithmic tools for haplotyping is based on the assumption that the evolutionary history for the original haplotypes satisfies perfect phylogeny. The algorithm can be applied only on individual blocks of chromosomes, in which it is assumed that recombinations either do not happen or happen with small frequencies. However, exact determination of blocks is usually not possible. It would be desirable to develop a method for haplotyping which can account for recombinations, and thus can be applied on multiblock sections of chromosomes. A natural candidate for such a method is haplotyping via phylogenetic networks or their simplified version: galled-tree ...

• Type: Conference
• Year: 2008
• Where: COCOON
• Authors: Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
• Keywords: COCOON 2008, Combinatorics, Galled-tree Networks, Main Algorithmic Tools, Satisfies Perfect Phylogeny