A comparative study of SMILES-based compound similarity functions for drug-target interaction prediction

H Öztürk, E Ozkirimli, A Özgür - BMC bioinformatics, 2016 - Springer
BMC bioinformatics, 2016Springer
Background Molecular structures can be represented as strings of special characters using
SMILES. Since each molecule is represented as a string, the similarity between compounds
can be computed using SMILES-based string similarity functions. Most previous studies on
drug-target interaction prediction use 2D-based compound similarity kernels such as
SIMCOMP. To the best of our knowledge, using SMILES-based similarity functions, which
are computationally more efficient than the 2D-based kernels, has not been investigated for …
Background
Molecular structures can be represented as strings of special characters using SMILES. Since each molecule is represented as a string, the similarity between compounds can be computed using SMILES-based string similarity functions. Most previous studies on drug-target interaction prediction use 2D-based compound similarity kernels such as SIMCOMP. To the best of our knowledge, using SMILES-based similarity functions, which are computationally more efficient than the 2D-based kernels, has not been investigated for this task before.
Results
In this study, we adapt and evaluate various SMILES-based similarity methods for drug-target interaction prediction. In addition, inspired by the vector space model of Information Retrieval we propose cosine similarity based SMILES kernels that make use of the Term Frequency (TF) and Term Frequency-Inverse Document Frequency (TF-IDF) weighting approaches. We also investigate generating composite kernels by combining our best SMILES-based similarity functions with the SIMCOMP kernel. With this study, we provided a comparison of 13 different ligand similarity functions, each of which utilizes the SMILES string of molecule representation. Additionally, TF and TF-IDF based cosine similarity kernels are proposed.
Conclusion
The more efficient SMILES-based similarity functions performed similarly to the more complex 2D-based SIMCOMP kernel in terms of AUC-ROC scores. The TF-IDF based cosine similarity obtained a better AUC-PR score than the SIMCOMP kernel on the GPCR benchmark data set. The composite kernel of TF-IDF based cosine similarity and SIMCOMP achieved the best AUC-PR scores for all data sets.
Springer