Transitive closure and metric inequality of weighted graphs:detecting protein interaction modules using cliques
Journal Article
·
· International Journal of Data Mining andBioinformatics
OSTI ID:918813
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. We outline several applications and present results of detecting protein functional modules in a protein interaction network.
- Research Organization:
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOE Director. Office of Science. Biological andEnvironmental Research
- DOE Contract Number:
- DE-AC02-05CH11231
- OSTI ID:
- 918813
- Report Number(s):
- LBNL-61579; R&D Project: 442G07; BnR: KP1102010; TRN: US200819%%458
- Journal Information:
- International Journal of Data Mining andBioinformatics, Vol. 1, Issue 2; Related Information: Journal Publication Date: 2006
- Country of Publication:
- United States
- Language:
- English
Similar Records
A supernodal all-pairs shortest path algorithm
Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters
Transforming clique tree inequalities to induce facets for the 2-edge connected polytope
Conference
·
Sat Feb 01 00:00:00 EST 2020
·
OSTI ID:918813
+1 more
Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters
Conference
·
Mon Jun 01 00:00:00 EDT 2020
·
OSTI ID:918813
+3 more
Transforming clique tree inequalities to induce facets for the 2-edge connected polytope
Conference
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:918813