Ranking genes in functional networks according to a specific biological function is a challenging task raising relevant performance and computational complexity problems. To cope with both these problems we developed a transductive gene ranking method based on kernelized score functions able to fully exploit the topology and the graph structure of biomolecular networks and to capture significant functional relationships between genes. We run the method on a network constructed by integrating multiple biomolecular data sources in the yeast model organism, achieving significantly better results than the compared state-of-the-art network-based algorithms for gene function prediction, and with relevant savings in computational time. The proposed approach is general and fast enough to be in perspective applied to other relevant node ranking problems in large and complex biological networks.
A fast ranking algorithm for predicting gene functions in biomolecular networks / M. Re, M. Mesiti, G. Valentini. - In: IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS. - ISSN 1545-5963. - 9:6(2012 Dec), pp. 1812-1818.
|Titolo:||A fast ranking algorithm for predicting gene functions in biomolecular networks|
RE', MATTEO (Primo)
MESITI, MARCO (Secondo)
VALENTINI, GIORGIO (Ultimo)
|Parole Chiave:||Biological networks; Gene function prediction; Gene ranking; Kernel functions|
|Settore Scientifico Disciplinare:||Settore INF/01 - Informatica|
|Progetto:||Pattern Analysis, Statistical Modelling and Computational Learning 2|
|Data di pubblicazione:||dic-2012|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1109/TCBB.2012.114|
|Appare nelle tipologie:||01 - Articolo su periodico|