Answers are grounded in this paper and cite their sources.
) time scaling. BitBIRCH leverages the instant similarity (iSIM) formalism to process binary fingerprints, allowing the use of Tanimoto similarity, and reducing memory requirements. Our tests show that BitBIRCH is already >1000 times faster than standard implementations of the Taylor-Butina clustering for libraries with 1 500 000 molecules. BitBIRCH increases efficiency without compromising the quality of the resulting clusters. We explore strategies to handle large sets, which we applied in the clustering of one billion molecules under 5 hours using a parallel/iterative BitBIRCH approximation.
No takes yet. Share an insight, caveat, or question.
Pérez et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: