Transitive closure and metric inequality of weighted graphs: detecting protein interaction modules using cliques.

Our Research / Publications

janelia7_blocks-janelia7_biblio_header | block

International Journal of Data Mining and Bioinformatics. 2006 Jun 2;1:162-77. doi: 10.1007/s12021-010-9090-x

Ding C, He X, Xiong H, Peng H, Holbrook SR

Note: Research in this publication was not performed at Janelia.

janelia7_blocks-janelia7_biblio_abstract | block

Abstract

We study transitivity properties of edge weights in complex networks. We show that enforcing transitivity leads to a transitivity inequality which is equivalent to ultra-metric inequality. This can be used to define transitive closure on weighted undirected graphs, which can be computed using a modified Floyd-Warshall algorithm. These new concepts are extended to dissimilarity graphs and triangle inequalities. From this, we extend the clique concept from unweighted graph to weighted graph. We outline several applications and present results of detecting protein functional modules in a protein interaction network.

node:body | entity_field

Main Menu (Mobile)- Block

Main Menu - Block

Transitive closure and metric inequality of weighted graphs: detecting protein interaction modules using cliques.

Note: Research in this publication was not performed at Janelia.

Abstract