Cargando…
Optimal assignment methods for ligand-based virtual screening
BACKGROUND: Ligand-based virtual screening experiments are an important task in the early drug discovery stage. An ambitious aim in each experiment is to disclose active structures based on new scaffolds. To perform these "scaffold-hoppings" for individual problems and targets, a plethora...
Autores principales: | , , , |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
Springer
2009
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2820492/ https://www.ncbi.nlm.nih.gov/pubmed/20150995 http://dx.doi.org/10.1186/1758-2946-1-14 |
_version_ | 1782177381634539520 |
---|---|
author | Jahn, Andreas Hinselmann, Georg Fechner, Nikolas Zell, Andreas |
author_facet | Jahn, Andreas Hinselmann, Georg Fechner, Nikolas Zell, Andreas |
author_sort | Jahn, Andreas |
collection | PubMed |
description | BACKGROUND: Ligand-based virtual screening experiments are an important task in the early drug discovery stage. An ambitious aim in each experiment is to disclose active structures based on new scaffolds. To perform these "scaffold-hoppings" for individual problems and targets, a plethora of different similarity methods based on diverse techniques were published in the last years. The optimal assignment approach on molecular graphs, a successful method in the field of quantitative structure-activity relationships, has not been tested as a ligand-based virtual screening method so far. RESULTS: We evaluated two already published and two new optimal assignment methods on various data sets. To emphasize the "scaffold-hopping" ability, we used the information of chemotype clustering analyses in our evaluation metrics. Comparisons with literature results show an improved early recognition performance and comparable results over the complete data set. A new method based on two different assignment steps shows an increased "scaffold-hopping" behavior together with a good early recognition performance. CONCLUSION: The presented methods show a good combination of chemotype discovery and enrichment of active structures. Additionally, the optimal assignment on molecular graphs has the advantage to investigate and interpret the mappings, allowing precise modifications of internal parameters of the similarity measure for specific targets. All methods have low computation times which make them applicable to screen large data sets. |
format | Text |
id | pubmed-2820492 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2009 |
publisher | Springer |
record_format | MEDLINE/PubMed |
spelling | pubmed-28204922010-02-12 Optimal assignment methods for ligand-based virtual screening Jahn, Andreas Hinselmann, Georg Fechner, Nikolas Zell, Andreas J Cheminform Research Article BACKGROUND: Ligand-based virtual screening experiments are an important task in the early drug discovery stage. An ambitious aim in each experiment is to disclose active structures based on new scaffolds. To perform these "scaffold-hoppings" for individual problems and targets, a plethora of different similarity methods based on diverse techniques were published in the last years. The optimal assignment approach on molecular graphs, a successful method in the field of quantitative structure-activity relationships, has not been tested as a ligand-based virtual screening method so far. RESULTS: We evaluated two already published and two new optimal assignment methods on various data sets. To emphasize the "scaffold-hopping" ability, we used the information of chemotype clustering analyses in our evaluation metrics. Comparisons with literature results show an improved early recognition performance and comparable results over the complete data set. A new method based on two different assignment steps shows an increased "scaffold-hopping" behavior together with a good early recognition performance. CONCLUSION: The presented methods show a good combination of chemotype discovery and enrichment of active structures. Additionally, the optimal assignment on molecular graphs has the advantage to investigate and interpret the mappings, allowing precise modifications of internal parameters of the similarity measure for specific targets. All methods have low computation times which make them applicable to screen large data sets. Springer 2009-08-25 /pmc/articles/PMC2820492/ /pubmed/20150995 http://dx.doi.org/10.1186/1758-2946-1-14 Text en Copyright © 2009 Jahn et al; licensee BioMed Central Ltd. http://creativecommons.org/licenses/by/2.0 This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |
spellingShingle | Research Article Jahn, Andreas Hinselmann, Georg Fechner, Nikolas Zell, Andreas Optimal assignment methods for ligand-based virtual screening |
title | Optimal assignment methods for ligand-based virtual screening |
title_full | Optimal assignment methods for ligand-based virtual screening |
title_fullStr | Optimal assignment methods for ligand-based virtual screening |
title_full_unstemmed | Optimal assignment methods for ligand-based virtual screening |
title_short | Optimal assignment methods for ligand-based virtual screening |
title_sort | optimal assignment methods for ligand-based virtual screening |
topic | Research Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2820492/ https://www.ncbi.nlm.nih.gov/pubmed/20150995 http://dx.doi.org/10.1186/1758-2946-1-14 |
work_keys_str_mv | AT jahnandreas optimalassignmentmethodsforligandbasedvirtualscreening AT hinselmanngeorg optimalassignmentmethodsforligandbasedvirtualscreening AT fechnernikolas optimalassignmentmethodsforligandbasedvirtualscreening AT zellandreas optimalassignmentmethodsforligandbasedvirtualscreening |