methods for haplotype reconstruction
DESCRIPTION
METHODS FOR HAPLOTYPE RECONSTRUCTION. Andrew Morris Wellcome Trust Centre for Human Genetics March 6, 2003. Outline. Haplotypes and genotypes. Reconstruction in pedigrees. Reconstruction in unrelated individuals. Interpretation and LD assessment. Two stage analyses. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/1.jpg)
METHODS FOR HAPLOTYPE RECONSTRUCTION
Andrew MorrisWellcome Trust Centre for Human GeneticsMarch 6, 2003
![Page 2: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/2.jpg)
Outline
Haplotypes and genotypes. Reconstruction in pedigrees. Reconstruction in unrelated
individuals. Interpretation and LD assessment. Two stage analyses.
![Page 3: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/3.jpg)
Haplotypes and genotypes (1)
1 0 0 0 1
1 1 0 0 0
11 01 00 00 01
![Page 4: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/4.jpg)
Haplotypes and genotypes (1)
1 0 0 0 1
1 1 0 0 0
11 01 00 00 01
![Page 5: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/5.jpg)
Haplotypes and genotypes (1)
1 0 0 0 1
1 1 0 0 0
11 01 00 00 01
![Page 6: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/6.jpg)
Haplotypes and genotypes (1)
1 0 0 0 1
1 1 0 0 0
11 01 00 00 01
![Page 7: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/7.jpg)
Haplotypes and genotypes (2)
Individuals that are homozygous at every locus, or heterozygous at just one locus can be resolved.
Individuals that are heterozygous at k loci are consistent with 2k-1 configurations of haplotypes.
![Page 8: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/8.jpg)
Why do we need haplotypes?
Correlation between alleles at closely linked loci…
Fine-scale mapping studies. Association studies with multiple
markers in candidate genes. Investigating patterns of LD across
genomic regions. Inferring population histories.
![Page 9: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/9.jpg)
Molecular methods
Single molecule dilution. Allele specific long range PCR.
Prone to errors. Expensive and inefficient: low
throughput.
![Page 10: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/10.jpg)
Simplex family data (1)
00 01 00 11 x 01 11 01 01(M) (F)
00 01 01 01
![Page 11: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/11.jpg)
Simplex family data (1)
00 01 00 11 x 01 11 01 01(M) (F)
00 01 01 01
![Page 12: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/12.jpg)
Simplex family data (1)
00 01 00 11 x 01 11 01 01(M) (F)
00 01 01 01
Inferred haplotypes: 0001 / 0110
![Page 13: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/13.jpg)
Simplex family data (2)
00 01 00 01 x 01 01 00 01(M) (F)
00 01 00 01
Cannot be fully resolved…
![Page 14: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/14.jpg)
Pedigree data (1)
11 01 11 01 11 x 00 00 11 11 11
01 01 11 11 11 x 01 00 00 01 00
01 01 01 01 01 11 01 01 01 01 00 00 01 11 01
![Page 15: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/15.jpg)
Pedigree data (1)
11111 / 10101 x 00111 / 00111
11111 / 00111 x 00010 / 10000
11111 / 00000 11111 / 10000 00111 / 00010
![Page 16: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/16.jpg)
Pedigree data (1)
11111 / 10101 x 00111 / 00111
11111 / 00111 x 00010 / 10000
11111 / 00000 11111 / 10000 00111 / 00010
![Page 17: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/17.jpg)
Pedigree data (2)
Many combinations of haplotypes may be consistent with pedigree genotype data.
Complex computational problem. Need to make assumptions about
recombination. SIMWALK and MERLIN.
![Page 18: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/18.jpg)
Statistical approaches to reconstruct haplotypes in unrelated individuals
Parsimony methods: Clark’s algorithm. Likelihood methods: E-M algorithm. Bayesian methods: PHASE algorithm.
Aims: reconstruct haplotypes and/or estimate population frequencies.
![Page 19: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/19.jpg)
Clark’s algorithm (1)
Reconstruct haplotypes in unresolved individuals via parsimony.
Minimise number of haplotypes observed in sample.
Microsatellite or SNP genotypes.
![Page 20: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/20.jpg)
Clark’s algorithm (2)
1. Search for resolved individuals, and record all recovered haplotypes.
2. Compare each unresolved individual with list of recovered haplotypes.
3. If a recovered haplotype is identified, individual is resolved.
4. Complimentary haplotype added to list of recovered haplotypes.
5. Repeat 2-4 until all individuals are resolved or no more haplotypes can be recovered.
![Page 21: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/21.jpg)
Example
(A) 00 01 01 00(B) 00 00 00 00(C) 00 01 00 00(D) 01 11 01 11(E) 00 11 01 01(F) 01 11 11 00(G) 00 01 11 01(H) 00 01 01 11(I) 00 00 00 00(J) 00 00 00 11
![Page 22: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/22.jpg)
Example
(A) 00 01 01 00(B) 00 00 00 00(C) 00 01 00 00(D) 01 11 01 11(E) 00 11 01 01(F) 01 11 11 00(G) 00 01 11 01(H) 00 01 01 11(I) 00 00 00 00(J) 00 00 00 11
![Page 23: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/23.jpg)
Example
(A) 00 01 01 00(B) 0000 / 0000(C) 0000 / 0100(D) 01 11 01 11(E) 00 11 01 01(F) 0110 / 1110(G) 00 01 11 01(H) 00 01 01 11(I)0000 / 0000(J)0001 / 0001
Recovered haplotypes:
00000100011011100001
![Page 24: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/24.jpg)
Example
(A) 00 01 01 00(B) 0000 / 0000(C) 0000 / 0100(D) 01 11 01 11(E) 00 11 01 01(F) 0110 / 1110(G) 00 01 11 01(H) 00 01 01 11(I)0000 / 0000(J)0001 / 0001
Recovered haplotypes:
00000100011011100001
![Page 25: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/25.jpg)
Example
(A) 0000 / 0110(B) 0000 / 0000(C) 0000 / 0100(D) 01 11 01 11(E) 00 11 01 01(F) 0110 / 1110(G) 00 01 11 01(H) 00 01 01 11(I)0000 / 0000(J)0001 / 0001
Recovered haplotypes:
0000 01110100011011100001
![Page 26: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/26.jpg)
Example
(A) 0000 / 0110(B) 0000 / 0000(C) 0000 / 0100(D) 01 11 01 11(E) 0100 / 0111(F) 0110 / 1110(G) 00 01 11 01(H) 00 01 01 11(I)0000 / 0000(J)0001 / 0001
Recovered haplotypes:
0000 01110100 0011011011100001
![Page 27: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/27.jpg)
Example
(A) 0000 / 0110(B) 0000 / 0000(C) 0000 / 0100(D) 0111 / 1101(E) 0100 / 0111(F) 0110 / 1110(G) 0110 / 0011(H) 0001 / 0111(I)0000 / 0000(J)0001 / 0001
Recovered haplotypes:
0000 01110100 00110110 110111100001
![Page 28: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/28.jpg)
Example: problem…
(A) 0000 / 0110(B) 0000 / 0000(C) 0000 / 0100(D) 01 11 01 11(E) 0100 / 0111(F) 0110 / 1110(G) 00 01 11 01(H) 00 01 01 11(I)0000 / 0000(J)0001 / 0001
Recovered haplotypes:
0000 01110100 0011011011100001
![Page 29: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/29.jpg)
Example: problem…
(A) 0000 / 0110(B) 0000 / 0000(C) 0000 / 0100(D) 01 11 01 11(E) 0100 / 0111(F) 0110 / 1110(G) 00 01 11 01(H) 00 01 01 11(I)0000 / 0000(J)0001 / 0001
Recovered haplotypes:
0000 01110100 0010011011100001
![Page 30: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/30.jpg)
Clark’s algorithm: problems
Multiple solutions: try many different orderings of individuals.
No starting point for algorithm. Algorithm may leave many
unresolved individuals. How to deal with missing data?
![Page 31: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/31.jpg)
E-M algorithm (1)
Maximum likelihood method for population haplotype frequency estimation.
Allows for the fact that unresolved genotypes could be constructed from many different haplotype configurations.
Microsatellite or SNP genotypes.
![Page 32: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/32.jpg)
E-M algorithm (2)
Observed sample of N individuals with genotypes, G.
Unobserved population haplotype frequencies, h.
Unobserved configurations, H, consisting of a complimentary haplotype pairs Hi = {Hi1,Hi2}.
![Page 33: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/33.jpg)
E-M algorithm (3)
Likelihood:
f(G|h) = ∏k f(Gk|h)
= ∏k ∑i f(Gk|Hi) f(Hi|h)
where f(Hi|h) = f(Hi1|h) f(Hi2|h) under Hardy-Weinberg equilibrium.
![Page 34: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/34.jpg)
E-M algorithm (4)
Numerical algorithm used to obtain maximum likelihood estimates of h.
Initial set of haplotype frequencies h(0). Haplotype frequencies h(t) at iteration t
updated from frequencies at iteration t-1 using Expectation and Maximisation steps.
Continue until h(t) has converged.
![Page 35: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/35.jpg)
Expectation step
Use haplotype frequencies, h(t), to calculate the probability of resolving each genotype, Gk, into each possible haplotype configuration, Hi.
E(Hi|Gk,h(t)) = f(Gk|Hi) f(Hi1|h(t)) f(Hi2|h(t))
f(Gk|h(t))
![Page 36: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/36.jpg)
Maximisation step
Compute haplotype frequencies using procedure equivalent to gene counting.
hs(t+1) = ∑k ∑i Zsi E(Hi|Gk,h(t))
2N Zsi = number of copies (0,1,2) of sth
haplotype in configuration Hi.
![Page 37: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/37.jpg)
E-M algorithm: comments
Can handle missing data. For many loci, the number of
possible haplotypes is large, so population frequencies are difficult to estimate: re-parameterisation.
Does not provide reconstructed haplotype configuration for unresolved individuals: can use “maximum likelihood” configuration.
![Page 38: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/38.jpg)
PHASE algorithm (1)
Treats haplotype configuration for each unresolved individual as an unobserved random quantity.
Evaluate the conditional distribution, given a sample of unresolved genotype data.
Microsatellite or SNP genotypes. Reconstruction and population
haplotype frequency estimation.
![Page 39: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/39.jpg)
PHASE algorithm (2)
Bayesian framework: goal is to approximate posterior distribution of haplotype configurations f(H|G).
Implements Markov chain Monte Carlo (MCMC) methods to sample from f(H|G): Gibbs sampling.
Start at random configuration. Repeatedly select unresolved individuals at
random, and sample from their possible haplotype configurations, assuming all other individuals to be correctly resolved.
![Page 40: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/40.jpg)
PHASE algorithm (3)
Initial haplotype configuration H(0). Subsequent iterations obtain H(t+1) from
H(t) using the following steps: Select an unresolved individual,i, at random. Sample Hi
(t+1) from f(Hi|G,H-i(t)).
Set Hk(t+1) = Hk
(t) for all k ≠ i.
On convergence, each sampled configuration represents random draw from f(H|G).
![Page 41: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/41.jpg)
PHASE algorithm (4)
How to obtain f(Hi|G,H-i)? Base directly on sample frequency of
observed haplotypes in configuration H-i. Better to introduce prior model for
population haplotype frequencies, f(h). Coalescent process used to predict
likely patterns of haplotypes occurring in populations.
![Page 42: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/42.jpg)
![Page 43: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/43.jpg)
![Page 44: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/44.jpg)
![Page 45: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/45.jpg)
![Page 46: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/46.jpg)
PHASE algorithm (5)
Key principle…
Configuration Hi is more likely to consist of haplotypes Hi1 and Hi2 that are exactly the same as, or similar to, haplotypes in the configuration H-i.
![Page 47: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/47.jpg)
Example (1)
Resolved haplotypes 22544 and 22334. Unresolved individual 22 22 35 34 44.
![Page 48: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/48.jpg)
Example (1)
Resolved haplotypes 22544 and 22334. Unresolved individual 22 22 35 34 44. Possible configurations…
(1) 22334 / 22544(2) 22534 / 22344
![Page 49: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/49.jpg)
Example (1)
Resolved haplotypes 22544 and 22334. Unresolved individual 22 22 35 34 44. Possible configurations…
(1) 22334 / 22544(2) 22534 / 22344 -1 and +1
![Page 50: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/50.jpg)
Example (1)
Resolved haplotypes 22544 and 22334. Unresolved individual 22 22 35 34 44. Possible configurations…
(1) 22334 / 22544(2) 22534 / 22344 -1 and +1
Assign high probability to sampling configuration (1).
![Page 51: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/51.jpg)
Example (2)
Resolved haplotypes 22544 and 22334. Unresolved individual 22 22 46 34 44.
![Page 52: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/52.jpg)
Example (2)
Resolved haplotypes 22544 and 22334. Unresolved individual 22 22 46 34 44. Possible configurations:
(1) 22434 / 22644(2) 22634 / 22444
![Page 53: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/53.jpg)
Example (2)
Resolved haplotypes 22544 and 22334. Unresolved individual 22 22 46 34 44. Possible configurations:
(1) 22434 / 22644 +1 and +1(2) 22634 / 22444 +3 and -1
Assign high probability to sampling configuration (1).
![Page 54: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/54.jpg)
PHASE algorithm: comments
Allows for uncertainty in haplotype reconstruction in Bayesian framework.
Can handle missing data. Coalescent process does not explicitly
allow for recombination, but performs well even when cross-over events occur (up to ~0.1cM).
Up to 50% more efficient than Clark’s algorithm or the E-M algorithm.
![Page 55: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/55.jpg)
PHASE algorithm: output
“Best” reconstruction output for each individual. Uncertainty in reconstruction indicated by system
of brackets: [] inferred missing genotype uncertain with
posterior probability less than specified threshold; () inferred phase assignment uncertain with
posterior probability less than specified threshold.
[0] [(1)] 0 0 1 (0)[0] [(0)] 1 0 1 (1)
![Page 56: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/56.jpg)
PHASE algorithm: interpretation
“Best” reconstruction not necessarily correct.
Uncertain haplotype configurations should be investigated further.
Effective targeting of additional genotyping costs.
![Page 57: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/57.jpg)
Other Bayesian MCMC algorithms
HAPLOTYPER Prior model for haplotype frequencies given by
Dirichelet distribution. Deals with large number of SNPs by partition
ligation. Outputs “best” reconstruction with uncertainty
measured by posterior probability. HAPMCMC
Log-linear prior model for haplotype frequencies incorporating interactions corresponding to first order LD between SNPs.
Designed specifically for investigating LD across small genomic regions.
![Page 58: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/58.jpg)
Don’t ignore uncertainty…
Tempting to treat “best” configuration as correct in subsequent analyses.
Can seriously affect inferences…
Example: LD across small genomic regions…
![Page 59: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/59.jpg)
False positive error rates
Level E-M PHASE(BEST)
HAPMCMC(BEST)
HAPMCMC(POST)
0.01 0.008 0.204 0.060 0.009
0.05 0.045 0.362 0.183 0.056
0.1 0.103 0.446 0.247 0.091
0.2 0.212 0.566 0.392 0.201
0.5 0.524 0.767 0.640 0.527
![Page 60: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/60.jpg)
Two stage analyses
For many studies, haplotype reconstruction is just an intermediate step required for a second stage of analysis.
We don’t actually care what the haplotypes are: missing data that we must account for in second stage of analysis.
Better to develop methods that allow for uncertainty in haplotype configuration in unresolved individuals, rather than haplotype reconstruction methods per-se.
![Page 61: METHODS FOR HAPLOTYPE RECONSTRUCTION](https://reader034.vdocuments.mx/reader034/viewer/2022051401/5681306f550346895d9650ea/html5/thumbnails/61.jpg)
Summary
Haplotype information required for analysis of high-density marker data.
Many algorithms available. Interpret output with care. Reconstructed haplotypes often not
of interest, but uncertainty must be accounted for in subsequent analyses.