Kenneth Lopez-Perez, Bill Zhao and Ramón Alain Miranda-Quintana*,
{"title":"iSIM-Sigma: Efficient Standard Deviation Calculation for Molecular Similarity","authors":"Kenneth Lopez-Perez, Bill Zhao and Ramón Alain Miranda-Quintana*, ","doi":"10.1021/acs.jcim.5c00894","DOIUrl":null,"url":null,"abstract":"<p >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.</p>","PeriodicalId":44,"journal":{"name":"Journal of Chemical Information and Modeling ","volume":"65 13","pages":"6797–6808"},"PeriodicalIF":5.3000,"publicationDate":"2025-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Chemical Information and Modeling ","FirstCategoryId":"92","ListUrlMain":"https://pubs.acs.org/doi/10.1021/acs.jcim.5c00894","RegionNum":2,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MEDICINAL","Score":null,"Total":0}
引用次数: 0
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, O(N2). 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 N molecules and M features) for the Russell–Rao (RR) and Sokal–Michener (SM) similarity indexes in O(NM2) complexity. Furthermore, we present a highly accurate linear complexity approximation, O(N), 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.
期刊介绍:
The Journal of Chemical Information and Modeling publishes papers reporting new methodology and/or important applications in the fields of chemical informatics and molecular modeling. Specific topics include the representation and computer-based searching of chemical databases, molecular modeling, computer-aided molecular design of new materials, catalysts, or ligands, development of new computational methods or efficient algorithms for chemical software, and biopharmaceutical chemistry including analyses of biological activity and other issues related to drug discovery.
Astute chemists, computer scientists, and information specialists look to this monthly’s insightful research studies, programming innovations, and software reviews to keep current with advances in this integral, multidisciplinary field.
As a subscriber you’ll stay abreast of database search systems, use of graph theory in chemical problems, substructure search systems, pattern recognition and clustering, analysis of chemical and physical data, molecular modeling, graphics and natural language interfaces, bibliometric and citation analysis, and synthesis design and reactions databases.