Fig. 4From: Detection and visualization of complex structural variants from long reads(Left:) An example of a graph G derived from a pairwise alignment. Perfect junctions are shown as green connections between alignment matches, novel insertion connections are shown as red dashed lines. (Right:) The highest scoring subgraph G∗ that contains the pattern of a dispersed duplicationBack to article page