Email updates

Keep up to date with the latest news and content from BMC Bioinformatics and BioMed Central.

Open Access Research article

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

Rodrigo C Barros1*, Ana T Winck2, Karina S Machado3, Márcio P Basgalupp4, André CPLF de Carvalho1, Duncan D Ruiz5 and Osmar Norberto de Souza5

Author Affiliations

1 University of São Paulo, São Carlos, Brazil

2 Federal University of Santa Maria, Santa Maria, Brazil

3 Federal University of Rio Grande, Rio Grande, Brazil

4 Federal University of São Paulo, São José dos Campos, Brazil

5 Pontifical Catholic University of Rio Grande do Sul, Porto Alegre, Brazil

For all author emails, please log on.

BMC Bioinformatics 2012, 13:310  doi:10.1186/1471-2105-13-310

Published: 21 November 2012

Abstract

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.