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

PDF Version Also Available for Download.

Description

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.

Creation Information

Ding, Chris; He, Xiaofeng; Xiong, Hui; Peng, Hanchuan & Holbrook,Stephen R. June 2, 2006.

Context

This article is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided by UNT Libraries Government Documents Department to Digital Library, a digital repository hosted by the UNT Libraries. It has been viewed 19 times , with 9 in the last month . More information about this article can be viewed below.

Who

People and organizations associated with either the creation of this article or its content.

Publisher

Provided By

UNT Libraries Government Documents Department

Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.

Contact Us

What

Descriptive information to help identify this article. Follow the links below to find similar items on the Digital Library.

Description

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.

Subjects

Keywords

STI Subject Categories

Source

  • Journal Name: International Journal of Data Mining andBioinformatics; Journal Volume: 1; Journal Issue: 2; Related Information: Journal Publication Date: 2006

Language

Item Type

Identifier

Unique identifying numbers for this article in the Digital Library or other systems.

  • Report No.: LBNL--61579
  • Grant Number: DE-AC02-05CH11231
  • Office of Scientific & Technical Information Report Number: 918813
  • Archival Resource Key: ark:/67531/metadc888778

Collections

This article is part of the following collection of related materials.

Office of Scientific & Technical Information Technical Reports

What responsibilities do I have when using this article?

When

Dates and time periods associated with this article.

Creation Date

  • June 2, 2006

Added to The UNT Digital Library

  • Sept. 22, 2016, 2:13 a.m.

Description Last Updated

  • Sept. 29, 2016, 7:16 p.m.

Usage Statistics

When was this article last used?

Yesterday: 0
Past 30 days: 9
Total Uses: 19

Interact With This Article

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

Citations, Rights, Re-Use

Ding, Chris; He, Xiaofeng; Xiong, Hui; Peng, Hanchuan & Holbrook,Stephen R. Transitive closure and metric inequality of weighted graphs:detecting protein interaction modules using cliques, article, June 2, 2006; Berkeley, California. (digital.library.unt.edu/ark:/67531/metadc888778/: accessed September 23, 2017), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT Libraries Government Documents Department.