Figure 4From: Graph-based clustering and characterization of repetitive sequences in next-generation sequencing dataExamples of graph layouts derived from clusters of repetitive sequences. Graph layouts were calculated using the 3D version of Fruchterman and Reingold algorithm from which a 2D projection is shown. Individual reads are represented by vertices and similar reads are connected by edges. Individual clusters are described further in Table 1.Back to article page