Skip to main content


Figure 2 | BMC Bioinformatics

Figure 2

From: TIGER: tiled iterative genome assembler

Figure 2

Contig clustering algorithm. Words are extracted from contigs. The number of common words between two contigs is used as the edge weight in the graph. Contig lengths are modeled as vertex weights. The contig connectivity graph is thus built, followed by the METIS partitioning process. The partitioned sub-graphs are clustered contig sets.

Back to article page