Skip to main content
. 2022 Nov 30;39(1):btac743. doi: 10.1093/bioinformatics/btac743

Fig. 2.

Fig. 2.

Experimental results from the application of seqwish to four different pangenomes. Each plot shows the runtime (in hours) versus the average input genome length calculated as the total length of all sequences in the pangenome divided by the number of included haplotypes. Multiple minimum identity settings for the mapping (wfmash -p) and different minimum match length filter settings (seqwish -k) result in a collection of graph builds per pangenome input. We compare the runtime in hours with the size of the resulting graphs relative to the average size of an input genome in the particular set. Lower limits on pairwise identity result in more compact graphs. Similarly, filtering short matches increases graph size relative to not (seqwish -k =0, red). The other way around, increasing the seqwish -k parameter tends to increase the size of the graph