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 networks, which were introduced by Wang, Zhang, Zhang ([25]) to model recombinations. However, even haplotyping via galled-tree networks appears hard, as the algorithms exist only for very special cases: the galled-tree network has either a single gall ([23]) or only small galls with two mutations each ([8]). Building on our previous results ([6]) we show that, in general, haplotyping via galled-tree networks is NP-complete, and thus indeed hard. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Gupta, A., Maňuch, J., Stacho, L., & Zhao, X. (2008). Haplotype inferring via galled-tree networks is NP-complete. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5092 LNCS, pp. 287–298). https://doi.org/10.1007/978-3-540-69733-6_29
Mendeley helps you to discover research relevant for your work.