Automatic design of decision-tree induction algorithms tailored to flexible-receptor docking data

Detalhes bibliográficos
Autor(a) principal: Barros, Rodrigo C.
Data de Publicação: 2012
Outros Autores: Winck, Ana T., Machado, Karina S., Basgalupp, Marcio Porto [UNIFESP], Carvalho, Andre C. P. L. F. de, Ruiz, Duncan D., Souza, Osmar Norberto de
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Institucional da UNIFESP
Texto Completo: http://dx.doi.org/10.1186/1471-2105-13-310
http://repositorio.unifesp.br/handle/11600/35511
Resumo: Background: This paper addresses the prediction of the free energy of binding of a drug candidate with enzyme InhA associated with Mycobacterium tuberculosis. This problem is found within rational drug design, where interactions between drug candidates and target proteins are verified through molecular docking simulations. in this application, it is important not only to correctly predict the free energy of binding, but also to provide a comprehensible model that could be validated by a domain specialist. Decision-tree induction algorithms have been successfully used in drug-design related applications, specially considering that decision trees are simple to understand, interpret, and validate. There are several decision-tree induction algorithms available for general-use, but each one has a bias that makes it more suitable for a particular data distribution. in this article, we propose and investigate the automatic design of decision-tree induction algorithms tailored to particular drug-enzyme binding data sets. We investigate the performance of our new method for evaluating binding conformations of different drug candidates to InhA, and we analyze our findings with respect to decision tree accuracy, comprehensibility, and biological relevance.Results: the empirical analysis indicates that our method is capable of automatically generating decision-tree induction algorithms that significantly outperform the traditional C4.5 algorithm with respect to both accuracy and comprehensibility. in addition, we provide the biological interpretation of the rules generated by our approach, reinforcing the importance of comprehensible predictive models in this particular bioinformatics application.Conclusions: We conclude that automatically designing a decision-tree algorithm tailored to molecular docking data is a promising alternative for the prediction of the free energy from the binding of a drug candidate with a flexible-receptor.
id UFSP_1c15b4f65b898b7ca103aab3879161d4
oai_identifier_str oai:repositorio.unifesp.br/:11600/35511
network_acronym_str UFSP
network_name_str Repositório Institucional da UNIFESP
repository_id_str 3465
spelling Automatic design of decision-tree induction algorithms tailored to flexible-receptor docking dataBackground: This paper addresses the prediction of the free energy of binding of a drug candidate with enzyme InhA associated with Mycobacterium tuberculosis. This problem is found within rational drug design, where interactions between drug candidates and target proteins are verified through molecular docking simulations. in this application, it is important not only to correctly predict the free energy of binding, but also to provide a comprehensible model that could be validated by a domain specialist. Decision-tree induction algorithms have been successfully used in drug-design related applications, specially considering that decision trees are simple to understand, interpret, and validate. There are several decision-tree induction algorithms available for general-use, but each one has a bias that makes it more suitable for a particular data distribution. in this article, we propose and investigate the automatic design of decision-tree induction algorithms tailored to particular drug-enzyme binding data sets. We investigate the performance of our new method for evaluating binding conformations of different drug candidates to InhA, and we analyze our findings with respect to decision tree accuracy, comprehensibility, and biological relevance.Results: the empirical analysis indicates that our method is capable of automatically generating decision-tree induction algorithms that significantly outperform the traditional C4.5 algorithm with respect to both accuracy and comprehensibility. in addition, we provide the biological interpretation of the rules generated by our approach, reinforcing the importance of comprehensible predictive models in this particular bioinformatics application.Conclusions: We conclude that automatically designing a decision-tree algorithm tailored to molecular docking data is a promising alternative for the prediction of the free energy from the binding of a drug candidate with a flexible-receptor.Univ São Paulo, Sao Carlos, SP, BrazilUniv Fed Santa Maria, BR-97119900 Santa Maria, RS, BrazilFed Univ Rio Grande, Rio Grande, BrazilUniversidade Federal de São Paulo, Sao Jose Dos Campos, BrazilPontificia Univ Catolica Rio Grande do Sul, Porto Alegre, RS, BrazilUniversidade Federal de São Paulo, Sao Jose Dos Campos, BrazilWeb of ScienceFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Biomed Central LtdUniversidade de São Paulo (USP)Universidade Federal de Sergipe (UFS)Fed Univ Rio GrandeUniversidade Federal de São Paulo (UNIFESP)Pontificia Univ Catolica Rio Grande do SulBarros, Rodrigo C.Winck, Ana T.Machado, Karina S.Basgalupp, Marcio Porto [UNIFESP]Carvalho, Andre C. P. L. F. deRuiz, Duncan D.Souza, Osmar Norberto de2016-01-24T14:28:01Z2016-01-24T14:28:01Z2012-11-21info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersion14application/pdfhttp://dx.doi.org/10.1186/1471-2105-13-310Bmc Bioinformatics. London: Biomed Central Ltd, v. 13, 14 p., 2012.10.1186/1471-2105-13-310WOS000313011300001.pdf1471-2105http://repositorio.unifesp.br/handle/11600/35511WOS:000313011300001engBmc Bioinformaticsinfo:eu-repo/semantics/openAccessreponame:Repositório Institucional da UNIFESPinstname:Universidade Federal de São Paulo (UNIFESP)instacron:UNIFESP2024-08-08T16:16:24Zoai:repositorio.unifesp.br/:11600/35511Repositório InstitucionalPUBhttp://www.repositorio.unifesp.br/oai/requestbiblioteca.csp@unifesp.bropendoar:34652024-08-08T16:16:24Repositório Institucional da UNIFESP - Universidade Federal de São Paulo (UNIFESP)false
dc.title.none.fl_str_mv Automatic design of decision-tree induction algorithms tailored to flexible-receptor docking data
title Automatic design of decision-tree induction algorithms tailored to flexible-receptor docking data
spellingShingle Automatic design of decision-tree induction algorithms tailored to flexible-receptor docking data
Barros, Rodrigo C.
title_short Automatic design of decision-tree induction algorithms tailored to flexible-receptor docking data
title_full Automatic design of decision-tree induction algorithms tailored to flexible-receptor docking data
title_fullStr Automatic design of decision-tree induction algorithms tailored to flexible-receptor docking data
title_full_unstemmed Automatic design of decision-tree induction algorithms tailored to flexible-receptor docking data
title_sort Automatic design of decision-tree induction algorithms tailored to flexible-receptor docking data
author Barros, Rodrigo C.
author_facet Barros, Rodrigo C.
Winck, Ana T.
Machado, Karina S.
Basgalupp, Marcio Porto [UNIFESP]
Carvalho, Andre C. P. L. F. de
Ruiz, Duncan D.
Souza, Osmar Norberto de
author_role author
author2 Winck, Ana T.
Machado, Karina S.
Basgalupp, Marcio Porto [UNIFESP]
Carvalho, Andre C. P. L. F. de
Ruiz, Duncan D.
Souza, Osmar Norberto de
author2_role author
author
author
author
author
author
dc.contributor.none.fl_str_mv Universidade de São Paulo (USP)
Universidade Federal de Sergipe (UFS)
Fed Univ Rio Grande
Universidade Federal de São Paulo (UNIFESP)
Pontificia Univ Catolica Rio Grande do Sul
dc.contributor.author.fl_str_mv Barros, Rodrigo C.
Winck, Ana T.
Machado, Karina S.
Basgalupp, Marcio Porto [UNIFESP]
Carvalho, Andre C. P. L. F. de
Ruiz, Duncan D.
Souza, Osmar Norberto de
description Background: This paper addresses the prediction of the free energy of binding of a drug candidate with enzyme InhA associated with Mycobacterium tuberculosis. This problem is found within rational drug design, where interactions between drug candidates and target proteins are verified through molecular docking simulations. in this application, it is important not only to correctly predict the free energy of binding, but also to provide a comprehensible model that could be validated by a domain specialist. Decision-tree induction algorithms have been successfully used in drug-design related applications, specially considering that decision trees are simple to understand, interpret, and validate. There are several decision-tree induction algorithms available for general-use, but each one has a bias that makes it more suitable for a particular data distribution. in this article, we propose and investigate the automatic design of decision-tree induction algorithms tailored to particular drug-enzyme binding data sets. We investigate the performance of our new method for evaluating binding conformations of different drug candidates to InhA, and we analyze our findings with respect to decision tree accuracy, comprehensibility, and biological relevance.Results: the empirical analysis indicates that our method is capable of automatically generating decision-tree induction algorithms that significantly outperform the traditional C4.5 algorithm with respect to both accuracy and comprehensibility. in addition, we provide the biological interpretation of the rules generated by our approach, reinforcing the importance of comprehensible predictive models in this particular bioinformatics application.Conclusions: We conclude that automatically designing a decision-tree algorithm tailored to molecular docking data is a promising alternative for the prediction of the free energy from the binding of a drug candidate with a flexible-receptor.
publishDate 2012
dc.date.none.fl_str_mv 2012-11-21
2016-01-24T14:28:01Z
2016-01-24T14:28:01Z
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://dx.doi.org/10.1186/1471-2105-13-310
Bmc Bioinformatics. London: Biomed Central Ltd, v. 13, 14 p., 2012.
10.1186/1471-2105-13-310
WOS000313011300001.pdf
1471-2105
http://repositorio.unifesp.br/handle/11600/35511
WOS:000313011300001
url http://dx.doi.org/10.1186/1471-2105-13-310
http://repositorio.unifesp.br/handle/11600/35511
identifier_str_mv Bmc Bioinformatics. London: Biomed Central Ltd, v. 13, 14 p., 2012.
10.1186/1471-2105-13-310
WOS000313011300001.pdf
1471-2105
WOS:000313011300001
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Bmc Bioinformatics
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 14
application/pdf
dc.publisher.none.fl_str_mv Biomed Central Ltd
publisher.none.fl_str_mv Biomed Central Ltd
dc.source.none.fl_str_mv reponame:Repositório Institucional da UNIFESP
instname:Universidade Federal de São Paulo (UNIFESP)
instacron:UNIFESP
instname_str Universidade Federal de São Paulo (UNIFESP)
instacron_str UNIFESP
institution UNIFESP
reponame_str Repositório Institucional da UNIFESP
collection Repositório Institucional da UNIFESP
repository.name.fl_str_mv Repositório Institucional da UNIFESP - Universidade Federal de São Paulo (UNIFESP)
repository.mail.fl_str_mv biblioteca.csp@unifesp.br
_version_ 1814268434198822912