title: A fast ranking algorithm for predicting gene functions in biomolecular networks.
abstract: 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.
authors.affiliation: Dipartimento di Informatica, Università degli Studi di Milano, Via Comelico 39/41, I-20135 Milano, Italia. re@di.unimi.it
authors.forename: Matteo
authors.initials: M
authors.lastname: Re
authors.forename: Marco
authors.initials: M
authors.lastname: Mesiti
authors.forename: Giorgio
authors.initials: G
authors.lastname: Valentini
mesh_terms: D000465:Algorithms; D000818:Animals; D019295:Computational Biology / Q000379:methods*; D053263:Gene Regulatory Networks; D005796:Genes; D051379:Mice