An MCMC algorithm for haplotype assembly from whole-genome sequence data

(Downloading may take up to 30 seconds. If the slide opens in your browser, select File -> Save As to save it.)

Click on image to view larger version.

Figure 7.
Figure 7.

The percentage of variant calls that are inconsistent with the best haplotype assembly for three different methods: Greedy heuristic (Levy et al. 2007), MCMC algorithm with Γ1 and the HASH algorithm for the 22 autosomes of HuRef.

This Article

  1. Genome Res. 18: 1336-1346

Preprint Server



Current Issue

  1. February 2026, 36 (2)
  1. Current Issue
  1. Alert me to new issues of Genome Research