scholar.google.com › citations
Feb 13, 2016 � This is an NP-hard problem and some pedigrees can have thousands of individuals and hundreds of thousands of sites. This paper formulates this�...
This section gives the background for inferring haplotype configurations from genotype data of a pedigree. We use the Iverson bracket notation, so that [E]�...
We study the haplotype inference problem from pedigree data under the zero recombination assumption, which is well supported by real data for tightly linked�...
Missing: Few | Show results with:Few
Pedigrees have been shown a valuable data that allows us to infer haplotypes from genotypes more accurately than population data, since Mendelian inheritance�...
A fundamental problem in computational biology is to find, for a pedigree with n individuals genotyped at every site, a set of Mendelian-consistent�...
Jul 19, 2011 � Abstract:The Minimum-Recombinant Haplotype Configuration problem (MRHC) has been highly successful in providing a sound combinatorial�...
People also ask
What is haplotype inference?
What is haplotype analysis pedigree?
What are haplotype combinations of genes?
Recombination happens when complementary parts of both of a parent's haplotypes can be inherited as a single combined haplotype of a child (Figure 1).
This article presents a six-rule algorithm for the reconstruction of multiple minimum-recombinant haplotype configurations in pedigrees.
Dec 12, 2006 � Thus it is believed that haplotype configurations with fewer recombinations should be preferred in haplotype inference [7–9]. When the�...
Chapter 5. Haplotype Inference on a Genome-wide Level. 45. 5.1 Detect Recombination Events in Families with Dense Markers.
