Author:
Cilia Elisa,Teso Stefano,Ammendola Sergio,Lenaerts Tom,Passerini Andrea
Abstract
Abstract
Background
Viruses are typically characterized by high mutation rates, which allow them to quickly develop drug-resistant mutations. Mining relevant rules from mutation data can be extremely useful to understand the virus adaptation mechanism and to design drugs that effectively counter potentially resistant mutants.
Results
We propose a simple statistical relational learning approach for mutant prediction where the input consists of mutation data with drug-resistance information, either as sets of mutations conferring resistance to a certain drug, or as sets of mutants with information on their susceptibility to the drug. The algorithm learns a set of relational rules characterizing drug-resistance and uses them to generate a set of potentially resistant mutants. Learning a weighted combination of rules allows to attach generated mutants with a resistance score as predicted by the statistical relational model and select only the highest scoring ones.
Conclusions
Promising results were obtained in generating resistant mutations for both nucleoside and non-nucleoside HIV reverse transcriptase inhibitors. The approach can be generalized quite easily to learning mutants characterized by more complex rules correlating multiple mutations.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,Molecular Biology,Biochemistry,Structural Biology
Reference46 articles.
1. Götte M, Li X, Wainberg M: HIV-1 reverse transcription: a brief overview focused on structure-function relationships among molecules involved in initiation of the reaction. Arch Biochem Biophys. 1999, 365 (2): 199-210. 10.1006/abbi.1999.1209.
2. Cao ZW, Han LY, Zheng CJ, Ji ZL, Chen X, Lin HH, Chen YZ: Computer prediction of drug resistance mutations in proteins REVIEWS. Drug Discov Today: BIOSILICO. 2005, 10 (7): 521-529. 10.1016/S1359-6446(05)03377-5.
3. Rubingh DN: Protein engineering from a bioindustrial point of view. Curr Opin Biotechnol. 1997, 8 (4): 417-422. 10.1016/S0958-1669(97)80062-6.
4. Muggleton S, De Raedt L: Inductive logic programming: theory and methods. J Logic Program. 1994, 19-20 (suppl 1): 629-682.
5. Landwehr N, Passerini A, De Raedt L, Frasconi P: kFOIL: learning simple relational kernels. Proceedings of the 21st national conference on Artificial intelligence - Volume 1. 2006, Palo Alto, California: AAAI Press, 389-394.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献