Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/117331
Title: miRBind : a deep learning method for miRNA binding classification
Authors: Klimentová, Eva
Hejret, Václav
Krčmář, Ján
Grešová, Katarína
Giassa, Ilektra-Chara
Alexiou, Panagiotis
Keywords: MicroRNA
Convolutions (Mathematics)
Neural networks (Computer science)
Issue Date: 2022
Publisher: MDPI AG
Citation: Klimentová, E., Hejret, V., Krčmář, J., Grešová, K., Giassa, I. C., & Alexiou, P. (2022). miRBind: a Deep Learning method for miRNA binding classification. Genes, 13(12), 2323.
Abstract: The binding of microRNAs (miRNAs) to their target sites is a complex process, mediated by the Argonaute (Ago) family of proteins. The prediction of miRNA:target site binding is an important first step for any miRNA target prediction algorithm. To date, the potential for miRNA:target site binding is evaluated using either co-folding free energy measures or heuristic approaches, based on the identification of binding ‘seeds’, i.e., continuous stretches of binding corresponding to specific parts of the miRNA. The limitations of both these families of methods have produced generations of miRNA target prediction algorithms that are primarily focused on ‘canonical’ seed targets, even though unbiased experimental methods have shown that only approximately half of in vivo miRNA targets are ‘canonical’. Herein, we present miRBind, a deep learning method and web server that can be used to accurately predict the potential of miRNA:target site binding. We trained our method using seed-agnostic experimental data and show that our method outperforms both seed-based approaches and co-fold free energy approaches. The full code for the development of miRBind and a freely accessible web server are freely available.
URI: https://www.um.edu.mt/library/oar/handle/123456789/117331
Appears in Collections:Scholarly Works - FacHScABS

Files in This Item:
File Description SizeFormat 
miRBind.pdf634.79 kBAdobe PDFView/Open


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.