The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
A maximum common substructure-based algorithm for searching and predicting drug-like compounds
Open accessAbstract
Motivation: The prediction of biologically active compounds is of great importance for high-throughput screening (HTS) approaches in drug discovery and chemical genomics. Many computational methods in this area focus on measuring the structural similarities between chemical structures. However, traditional similarity measures are often too rigid or consider only global similarities between structures. The maximum common substructure (MCS) approach provides a more promising and flexible alternative for predicting bioactive compounds. Results: In this article, a new backtracking algorithm for MCS is proposed and compared to global similarity measurements. Our algorithm provides high flexibility in the matching process, and it is very efficient in identifying local structural similarities. To predict and cluster biologically active compounds more efficiently, the concept of basis compounds is proposed that enables researchers to easily combine the MCS-based and traditional similarity measures with modern machine learning techniques. Support vector machines (SVMs) are used to test how the MCS-based similarity measure and the basis compound vectorization method perform on two empirically tested datasets. The test results show that MCS complements the well-known atom pair descriptor-based similarity measure. By combining these two measures, our SVM-based model predicts the biological activities of chemical compounds with higher specificity and sensitivity. Contact: ycao@cs.ucr.edu Supplementary information: Supplementary data are available at Bioinformatics online.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An Introduction to Support Vector Machines and Other Kernel-based Learning Methods
Cristianini, N., & Shawe-Taylor, J. (2000) · doi:10.1017/cbo9780511801389 · Cited by 13,855
Statistics Notes: Diagnostic tests 2: predictive values
Altman, D. G., & Bland, J. M. (1994) · BMJ · doi:10.1136/bmj.309.6947.102 · Cited by 1,711
Robust classification for imprecise environments
Provost, F., & Fawcett, T. (2001) · Machine Learning · doi:10.1023/a:1007601015854 · Cited by 1,250
Database resources of the National Center for Biotechnology Information
Wheeler, D. L., Barrett, T., Benson, D. A., Bryant, S. H., Canese, K., Chetvernin, V., Church, D. M., DiCuccio, M., Edgar, R., Federhen, S., et al. (2007) · Nucleic Acids Research · doi:10.1093/nar/gkl1031 · Cited by 734
Why do we need so many chemical similarity search methods?
Sheridan, R. (2002) · Drug Discovery Today · doi:10.1016/s1359-6446(02)02411-x · Cited by 412
Cited by
NPClassifier: A Deep Neural Network-Based Structural Classification Tool for Natural Products
Kim, H. W., Wang, M., Leber, C. A., Nothias, L.-F., Reher, R., Kang, K. B., van der Hooft, J. J. J., Dorrestein, P. C., Gerwick, W. H., & Cottrell, G. W. (2021) · Journal of Natural Products · doi:10.1021/acs.jnatprod.1c00399 · Cited by 551
ChemMine tools: an online service for analyzing and clustering small molecules
Backman, T. W. H., Cao, Y., & Girke, T. (2011) · Nucleic Acids Research · doi:10.1093/nar/gkr320 · Cited by 504
Self-citationDiscovery of a structural class of antibiotics with explainable deep learning
Wong, F., Zheng, E. J., Valeri, J. A., Donghia, N. M., Anahtar, M. N., Omori, S., Li, A., Cubillos-Ruiz, A., Krishnan, A., Jin, W., et al. (2024) · Nature · doi:10.1038/s41586-023-06887-8 · Cited by 458
Lou, B., & Wu, L. (2021) · MIS Quarterly · doi:10.25300/misq/2021/16565 · Cited by 177
Martinize2 and Vermouth provide a unified framework for molecular topology generation
Kroon, P. C., Grünewald, F., Barnoud, J., van Tilburg, M., Brasnett, C., Souza, P. C., Wassenaar, T. A., & Marrink, S. J. (2025) · eLife · doi:10.7554/elife.90627 · Cited by 124
“Even though applying graph theory to molecules is not a new idea ( Engler et al., 2018 ; Engler et al., 2017 ; Cao et al., 2008 ), Vermouth is specifically designed to also handle CG level molecule transformation focusing on the Martini force field.”
Metadata
- Authors
- Cao, Y., Jiang, T., & Girke, T.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2008-07-01
- Volume
- 24
- Issue
- 13
- Pages
- i366-i374
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2145546477
- Cited by
- 210
- References
- 5
- FWCI
- 9.14
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A maximum common substructure-based algorithm for searching and predicting drug-like compounds. https://app.cochat.ai/papers/10.1093/bioinformatics/btn186
- The paper
- Cao, Y., Jiang, T., & Girke, T. (2008). A maximum common substructure-based algorithm for searching and predicting drug-like compounds. Bioinformatics. https://doi.org/10.1093/bioinformatics/btn186
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.