Abstract

With the increased availability of genome-scale data, it becomes possible to study functional relationships of genes across multiple biological networks. While most previous approaches for studying conservation of patterns in networks are through the application of network alignment algorithms or the identification of network motifs, we show that it is possible to exhaustively enumerate all graphlet alignments, which consist of subgraphs from each network that share a common topology and contain homologous proteins at the same position in the topology. We show that our algorithm is able to cover significantly more proteins than previous network alignment algorithms while achieving comparable specificity and higher sensitivity with respect to functional enrichment.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call