Work

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

Year: 2006

Type: article

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.

Source: International Journal of Data Mining and Bioinformatics

DOI: 10.1504/ijdmb.2006.010854

Authors: Chris Ding, Xiaofeng He, Hui Xiong, Hanchuan Peng, Stephen R. Holbrook

Institutions: Lawrence Berkeley National Laboratory, University of California, Berkeley

Language: English

Topic: Bioinformatics and Genomic Networks

Subfield: Molecular Biology

Field: Biochemistry, Genetics and Molecular Biology

Domain: Life Sciences

Open Access status: green

Funders: U.S. Department of Energy, Office of Science

OpenAlex ID: W2028563407

FWCI: 0.272

Cites: 16

Cited by: 24

Related to: 10