Extended Data Fig. 1: Clustering algorithms in Clusty.
From: Ultrafast and accurate sequence alignment and clustering of viral genomes
The dataset is represented as a graph: objects (genomes) are shown as vertices with sizes proportional to user-assigned weights (for example, sequence length) and edges indicate distances (for example, 1 – tANI). In the consecutive steps of each algorithm objects are assigned to clusters marked with distinct colors. The left panel shows each algorithm’s time complexity, with n as the number of vertices and e as the number of edges. Distance values for this example are available in the source data provided with the paper.
