Molecular function prediction using neighborhood features.
The recent advent of high-throughput methods has generated large amounts of gene interaction data. This has allowed the construction of genomewide networks. A significant number of genes in such networks remain uncharacterized and predicting the molecular function of these genes remains a major challenge. A number of existing techniques assume that genes with similar functions are topologically close in the network. Our hypothesis is that genes with similar functions observe similar annotation patterns in their neighborhood, regardless of the distance between them in the interaction network. We thus predict molecular functions of uncharacterized genes by comparing their functional neighborhoods to genes of known function. We propose a two-phase approach. First, we extract functional neighborhood features of a gene using Random Walks with Restarts. We then employ a KNN classifier to predict the function of uncharacterized genes based on the computed neighborhood features. We perform leave-one-out validation experiments on two S. cerevisiae interaction networks and show significant improvements over previous techniques. Our technique provides a natural control of the trade-off between accuracy and coverage of prediction. We further propose and evaluate prediction in sparse genomes by exploiting features from well-annotated genomes.
Bogdanov
Petko
P
Department of Computer Science, University of California at Santa Barbara, Santa Barbara, CA 93106-5110, USA.
Singh
Ambuj K
AK
D000818:Animals; D030541:Databases, Genetic; D053263:Gene Regulatory Networks; D005796:Genes; D023281:Genomics / Q000379:methods*; D015233:Models, Statistical; D010363:Pattern Recognition, Automated / Q000379:methods*; D012372:ROC Curve; D012441:Saccharomyces cerevisiae / Q000235:genetics