We describe a method to search for similarities across protein-protein interaction networks of different organisms. The technique core consists in computing a maximum weight matching of bipartite graphs resulting from comparing the neighbourhoods of proteins belonging to different networks. Both quantitative and reliability information are exploited. We tested the method on the networks of S. cerevisiae, D. melanogaster and C. elegans. The experiments showed that the technique is able to detect functional orthologs when the sole sequence similarity does not prove itself sufficient. They also demonstrated the capability of our approach in discovering common biological processes involving uncharacterised proteins.
|Numero di pagine||22|
|Rivista||International Journal of Data Mining and Bioinformatics|
|Stato di pubblicazione||Published - 2009|
All Science Journal Classification (ASJC) codes