Skip to content

Clustering advanced options

Benjamin J. Buchfink edited this page May 28, 2026 · 7 revisions

cluster/linclust/deepclust workflow

  • --no-block-size-limit

    Do not limit the block size to recommended maximums.

  • --no-reassign

    Do not reassign cluster members to closest representative after greedy vertex cover clustering.

recluster workflow

Warning

This workflow has been temporarily removed from the tool in v2.1.25.

Recompute clustering for strict cutoff values.

The clustering criterion parameters (--approx-id, --member-cover, --mutual-cover) set cutoff values for the local alignments between the cluster member and cluster representative sequences. These cutoffs serve to guide the computation, but due to the heuristic nature of the cascaded clustering algorithm, i.e. merging of clusters based on alignments of their representative sequences, their fulfillment is not always guaranteed.

This is not usually a problem as such cutoff values are pretty arbitrary numbers anyway and the deviations from them are mostly small.

If your application requires strict adherence to the clustering criterion, this workflow will recompute a new clustering from an existing clustering of the same dataset to ensure that all cluster member sequences satisfy the criterion vs their representative.

  • --clusters The input clustering as 2-column tabular format.

These parameters of the cluster workflow apply accordingly: --database/-d, --out/-o, --header, --memory-limit/-M, --approx-id, --no-block-size-limit, --member-cover, --mutual-cover.

reassign workflow

Warning

This workflow has been temporarily removed from the tool in v2.2.1.

For a given clustering, attempts to reassign all non-representative sequences to the closest representative sequence that satisfies the clustering criterion as measured by the e-value of the local alignment.

  • --clusters The input clustering as 2-column tabular format.

These parameters of the cluster workflow apply accordingly: --database/-d, --out/-o, --header, --memory-limit/-M, --approx-id, --no-block-size-limit, --member-cover, --mutual-cover.

greedy-vertex-cover workflow

Compute a clustering (using the greedy vertex cover algorithm) based on an input file of alignments.

  • --edges Input file containing alignments/graph edges for clustering. By default, a TSV file with 5 columns is expected: query target query-cover target-cover edge-weight.

    Coverages are in percent. Edge weights will give the larger number the bigger weight.

  • --edge-format triplet Enable triplet edge format: query target edge-weight. The semantic is uni-directional representation of the query by the target.

  • --database/-d A TSV file whose first column needs to be a list of all accessions that occur in the edges file as either query or target. This must not be a sequence database file.

  • --centroid-out Output file for representative list.

  • --out/-o The output clustering as a 2-column TSV format. This file does not group clusters together by representative.

  • --member-cover The cutoff value (in percent) for the cluster member coverage.

  • --symmetric Used together with --edge-format triplet to interpret alignments as bi-directional representation of query and target. Use this option to compute a bi-directional coverage clustering and pre-filter input alignments by the coverages (setting the --member-cover or --mutual-cover options will not filter according to mutual coverage in this workflow).

These parameters of the cluster workflow apply accordingly: --header, --no-reassign.

Clone this wiki locally