iSIM-Sigma: Efficient Standard Deviation Calculation for Molecular Similarity

The average and variance of the molecular similarities in a set are of high value and useful for cheminformatics tasks such as chemical space exploration and subset selection. However, the calculation of the variance of the complete similarity matrix has a quadratic complexity, <i>O</i>(<i>N</i><sup>2</sup>). As the sizes of molecular libraries constantly increase, this pairwise approach is unfeasible. In this work, we present an approach to calculate the exact standard deviation of molecular similarities in a set (with <i>N</i> molecules and <i>M</i> features) for the Russell-Rao (RR) and Sokal-Michener (SM) similarity indexes in <i>O</i>(<i>NM</i><sup>2</sup>) complexity. Furthermore, we present a highly accurate linear complexity approximation, <i>O</i>(<i>N</i>), based on sampling representative molecules from the set. The proposed approximation can be extended to other similarity indices, including the popular Jaccard-Tanimoto (JT). With only the sampling of 50 molecules, the proposed method can estimate the standard deviation of similarities in a set with an RMSE lower than 0.01 for sets of up to 50,000 molecules. In comparison, random sampling does not warrant a good approximation with the same number of selected molecules as shown in our results.

Authors

Institutions

Publication Details

Journal
Journal of Chemical Information and Modeling
Published
2025-06-18
DOI
https://doi.org/10.1021/acs.jcim.5c00894
Citations
5
Primary Topic
Computational Drug Discovery Methods
Type
article
Field-Weighted Citation Impact
7.52

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

iSIM-Sigma: Efficient Standard Deviation Calculation for Molecular Similarity

Ramón Alain Miranda‐Quintana, Kenneth López Pérez, Benhua Zhao
5 citations
Journal of Chemical Information and Modeling
Computational Drug Discovery Methods
7.52
article

iSIM-Sigma: Efficient Standard Deviation Calculation for Molecular Similarity

Ramón Alain Miranda‐Quintana, Kenneth López Pérez, Benhua Zhao
article en
5 citations

Abstract

The average and variance of the molecular similarities in a set are of high value and useful for cheminformatics tasks such as chemical space exploration and subset selection. However, the calculation of the variance of the complete similarity matrix has a quadratic complexity, <i>O</i>(<i>N</i><sup>2</sup>). As the sizes of molecular libraries constantly increase, this pairwise approach is unfeasible. In this work, we present an approach to calculate the exact standard deviation of molecular similarities in a set (with <i>N</i> molecules and <i>M</i> features) for the Russell-Rao (RR) and Sokal-Michener (SM) similarity indexes in <i>O</i>(<i>NM</i><sup>2</sup>) complexity. Furthermore, we present a highly accurate linear complexity approximation, <i>O</i>(<i>N</i>), based on sampling representative molecules from the set. The proposed approximation can be extended to other similarity indices, including the popular Jaccard-Tanimoto (JT). With only the sampling of 50 molecules, the proposed method can estimate the standard deviation of similarities in a set with an RMSE lower than 0.01 for sets of up to 50,000 molecules. In comparison, random sampling does not warrant a good approximation with the same number of selected molecules as shown in our results.

Journal of Chemical Information and ModelingVol. 65(13)
University of Florida (US)
National Institute of General Medical Sciences
Openalex Percentile: Top 3%
Computational Drug Discovery Methods
7.52
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.