Minimal positional substring cover is a haplotype threading alternative to Li and Stephens model

(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 3.
Figure 3.

Obtaining the longest paths of the set maximal matches in Ri from the longest paths of the set maximal matches in Ri+1 in O(|Ri| + |Ri+1|) time. Subgraph of Figure 2, i = 2.

This Article

  1. Published in Advance June 14, 2023, doi: 10.1101/gr.277673.123 Genome Res. 33: 1007-1014

Preprint Server



Current Issue

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