BFL: a node and edge betweenness based fast layout algorithm for large scale networks.

ABSTRACT:

Background

Network visualization would serve as a useful first step for analysis. However, current graph layout algorithms for biological pathways are insensitive to biologically important information, e.g. subcellular localization, biological node and graph attributes, or/and not available for large scale networks, e.g. more than 10000 elements.

Results

To overcome these problems, we propose the use of a biologically important graph metric, betweenness, a measure of network flow. This metric is highly correlated with many biological phenomena such as lethality and clusters. We devise a new fast parallel algorithm calculating betweenness to minimize the preprocessing cost. Using this metric, we also invent a node and edge betweenness based fast layout algorithm (BFL). BFL pl

SUBMITTER: Hashimoto TB 

PROVIDER: S-EPMC2753844 | biostudies-literature | 2009 Jan

REPOSITORIES: biostudies-literature