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

doi:10.1089/cmb.2009.0117

Back to search

Article

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

Journal of computational biology : a journal of computational molecular cell biology - 1 Oct 2010

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

Abstract excerpt

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 g...

Topics

Algorithms
Biological Evolution
Genotype
Haplotypes
Humans
Models, Genetic
Phylogeny
Polymorphism, Single Nucleotide

Community interpretation

Discuss the evidence

Ask a question, add context or challenge an interpretation. Community activity is separate from scientific evidence strength.

discussions

replies

Citations encouraged

Claims remain attributable.

No discussion yet

Be the first to add a careful, cited interpretation.