Skip to main content
. 2015 Sep 5;32(1):9–16. doi: 10.1093/bioinformatics/btv522

Fig. 1.

Fig. 1.

Hammock algorithm workflow. After the extraction of unique sequences, Hammock uses fast greedy clustering algorithm to identify initial cluster cores. The extension step adds more sequences into clusters and the merging step merges several clusters into one. The extension and merging steps are alternated several times with similarity requirements gradually relaxed. After the last merging step, resulting clusters and sequences not belonging to any cluster are reported