Haplotype inferring via galled-tree networks is NP-complete.

Arvind Gupta, Mohammad M. Karimi, Ján Manuch, Ladislav Stacho, Xiaohong Zhao

Research output: Contribution to journalArticle

Abstract

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. This tool can be applied only on individual blocks of chromosomes, in which it is assumed that recombinations do not happen. 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 (which model recombinations) or their simplified version: galled-tree networks. However, even haplotyping via galled-tree networks appears hard, as the efficient algorithms exist only for very special cases: the galled-tree network has either a single gall or only small galls with two mutations each. Building on our previous results, we show that, in general, haplotyping via galled-tree networks is NP-complete, and it remains NP-complete when galls are allowed to have at most k mutations, for any k≥3.

Original languageEnglish
Pages (from-to)1435-1449
Number of pages15
JournalJournal of computational biology : a journal of computational molecular cell biology
Volume17
Issue number10
Publication statusPublished - Oct 2010
Externally publishedYes

Fingerprint

Tree Networks
Haplotype
Chromosomes
Haplotypes
Genetic Recombination
NP-complete problem
Recombination
Chromosome
HapMap Project
Mutation
Inborn Genetic Diseases
Phylogenetic Network
Phylogeny
Multiblock
Single Nucleotide Polymorphism
History
Genotype
Network Model
Efficient Algorithms
Research

ASJC Scopus subject areas

  • Medicine(all)

Cite this

Haplotype inferring via galled-tree networks is NP-complete. / Gupta, Arvind; Karimi, Mohammad M.; Manuch, Ján; Stacho, Ladislav; Zhao, Xiaohong.

In: Journal of computational biology : a journal of computational molecular cell biology, Vol. 17, No. 10, 10.2010, p. 1435-1449.

Research output: Contribution to journalArticle

Gupta, Arvind ; Karimi, Mohammad M. ; Manuch, Ján ; Stacho, Ladislav ; Zhao, Xiaohong. / Haplotype inferring via galled-tree networks is NP-complete. In: Journal of computational biology : a journal of computational molecular cell biology. 2010 ; Vol. 17, No. 10. pp. 1435-1449.
@article{40012d69384e43a4907fb6cba49ea264,
title = "Haplotype inferring via galled-tree networks is NP-complete.",
abstract = "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. This tool can be applied only on individual blocks of chromosomes, in which it is assumed that recombinations do not happen. 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 (which model recombinations) or their simplified version: galled-tree networks. However, even haplotyping via galled-tree networks appears hard, as the efficient algorithms exist only for very special cases: the galled-tree network has either a single gall or only small galls with two mutations each. Building on our previous results, we show that, in general, haplotyping via galled-tree networks is NP-complete, and it remains NP-complete when galls are allowed to have at most k mutations, for any k≥3.",
author = "Arvind Gupta and Karimi, {Mohammad M.} and J{\'a}n Manuch and Ladislav Stacho and Xiaohong Zhao",
year = "2010",
month = "10",
language = "English",
volume = "17",
pages = "1435--1449",
journal = "Journal of Computational Biology",
issn = "1066-5277",
publisher = "Mary Ann Liebert Inc.",
number = "10",

}

TY - JOUR

T1 - Haplotype inferring via galled-tree networks is NP-complete.

AU - Gupta, Arvind

AU - Karimi, Mohammad M.

AU - Manuch, Ján

AU - Stacho, Ladislav

AU - Zhao, Xiaohong

PY - 2010/10

Y1 - 2010/10

N2 - 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. This tool can be applied only on individual blocks of chromosomes, in which it is assumed that recombinations do not happen. 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 (which model recombinations) or their simplified version: galled-tree networks. However, even haplotyping via galled-tree networks appears hard, as the efficient algorithms exist only for very special cases: the galled-tree network has either a single gall or only small galls with two mutations each. Building on our previous results, we show that, in general, haplotyping via galled-tree networks is NP-complete, and it remains NP-complete when galls are allowed to have at most k mutations, for any k≥3.

AB - 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. This tool can be applied only on individual blocks of chromosomes, in which it is assumed that recombinations do not happen. 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 (which model recombinations) or their simplified version: galled-tree networks. However, even haplotyping via galled-tree networks appears hard, as the efficient algorithms exist only for very special cases: the galled-tree network has either a single gall or only small galls with two mutations each. Building on our previous results, we show that, in general, haplotyping via galled-tree networks is NP-complete, and it remains NP-complete when galls are allowed to have at most k mutations, for any k≥3.

UR - http://www.scopus.com/inward/record.url?scp=79952279713&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79952279713&partnerID=8YFLogxK

M3 - Article

C2 - 20937016

VL - 17

SP - 1435

EP - 1449

JO - Journal of Computational Biology

JF - Journal of Computational Biology

SN - 1066-5277

IS - 10

ER -