In this paper, a linear-time algorithm, which is optimal, is presented to solve the haplotype inference problem for pedigree data when there are no recombinations and the pedigree has no mating loops. The approach is based on the use of graphs to capture SNP, Mendelian and parity constraints of the given pedigree. © Springer-Verlag Berlin Heidelberg 2006.link_to_subscribed_fulltex
The next phase of human genomics will involve large-scale screens of populations for significant DNA...
Identifying maternal and paternal inheritance is essential to be able to find the set of genes respo...
Genome-wide screening for localization of disease genes necessitates the efficient reconstruction of...
Abstract Background When studying genetic diseases in which genetic variations are passed on to offs...
Haplotyping under the Mendelian law of inheritance on pedigree genotype data is studied. Because gen...
The original publication is available at www.springerlink.comThe problem of haplotype inference unde...
Abstract An efficient rule-based algorithm is presented for haplotype inference from general pedigre...
Abstract Background Genome sequencing will soon produce haplotype data for individuals. For pedigree...
This article presents a six-rule algorithm for the reconstruction of multiple minimum-recombinant ha...
We study the problem of reconstructing haplotype configurations from genotypes on pedigree data with...
We address the problem of reconstructing haplotypes in a population, given a sample of genotypes and...
Abstract. We study the complexity and approximation of the problem of reconstructing haplotypes from...
SummaryIn an effort to accelerate likelihood computations on pedigrees, Lange and Goradia defined a ...
The genome of all organisms is partitioned into a fixed number of chromosomes. Mammals, including hu...
The paper addresses the combinatorial problem of inferring the unknown haplotypes in a population, g...
The next phase of human genomics will involve large-scale screens of populations for significant DNA...
Identifying maternal and paternal inheritance is essential to be able to find the set of genes respo...
Genome-wide screening for localization of disease genes necessitates the efficient reconstruction of...
Abstract Background When studying genetic diseases in which genetic variations are passed on to offs...
Haplotyping under the Mendelian law of inheritance on pedigree genotype data is studied. Because gen...
The original publication is available at www.springerlink.comThe problem of haplotype inference unde...
Abstract An efficient rule-based algorithm is presented for haplotype inference from general pedigre...
Abstract Background Genome sequencing will soon produce haplotype data for individuals. For pedigree...
This article presents a six-rule algorithm for the reconstruction of multiple minimum-recombinant ha...
We study the problem of reconstructing haplotype configurations from genotypes on pedigree data with...
We address the problem of reconstructing haplotypes in a population, given a sample of genotypes and...
Abstract. We study the complexity and approximation of the problem of reconstructing haplotypes from...
SummaryIn an effort to accelerate likelihood computations on pedigrees, Lange and Goradia defined a ...
The genome of all organisms is partitioned into a fixed number of chromosomes. Mammals, including hu...
The paper addresses the combinatorial problem of inferring the unknown haplotypes in a population, g...
The next phase of human genomics will involve large-scale screens of populations for significant DNA...
Identifying maternal and paternal inheritance is essential to be able to find the set of genes respo...
Genome-wide screening for localization of disease genes necessitates the efficient reconstruction of...
Add to ORKG