Skip to main content
. Author manuscript; available in PMC: 2011 Jun 1.
Published in final edited form as: Genomics. 2010 Mar 6;95(6):315–327. doi: 10.1016/j.ygeno.2010.03.001

Figure 4.

Figure 4

Three methods to resolve graph complexity. (a) Read threading joins paths across collapsed repeats that are shorter than the read lengths. (b) Mate threading joins paths across collapsed repeats that are shorter than the paired-end distances. (c) Path following chooses one path if its length fits the paired-end constraint. Reads and mates are shown as patterned lines. Not all tangles can be resolved by reads and mates. The non-branching paths are illustrative; they could be simplified to single edges or nodes.