Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2008 Jul 2;3(7):e2541.
doi: 10.1371/journal.pone.0002541.

Visualizing global properties of large complex networks

Weijiang Li  1 , Hiroyuki Kurata
Affiliations

Visualizing global properties of large complex networks

Weijiang Li et al. PLoS One. .

Abstract

For complex biological networks, graphical representations are highly desired for understanding some design principles, but few drawing methods are available that capture topological features of a large and highly heterogeneous network, such as a protein interaction network. Here we propose the circular perspective drawing (CPD) method to visualize global structures of large complex networks. The presented CPD combines the quasi-continuous search (QCS) analogous to the steepest descent method with a random node swapping strategy for an enhanced calculation speed. The CPD depicts a network in an aesthetic manner by showing connection patterns between different parts of the network instead of detailed links between nodes. Global structural features of networks exhibited by CPD provide clues toward a comprehensive understanding of the network organizations.

Availability: Software is freely available at http://www.cadlive.jp.

PubMed Disclaimer

Conflict of interest statement

Competing Interests: The authors have declared that no competing interests exist.

Figures

Figure 1
Figure 1. Global views of protein interaction networks by circular perspective drawings.
Each disc image represents a network whose nodes sit uniformly along the perimeter with minimal edge lengths. Pixels of the images are rendered colors with brightness proportional to logarithm of the number of passing-through edges. Nodes with only one link or disconnected to giant components were ignored in producing the drawings. See Materials and Methods for details of the networks. a, The yeast PIN. b, A randomized yeast PIN. c, A fully clusterized yeast PIN. The 4 clusters are clearly shown by the bright regions. d, A partially clusterized yeast PIN with a neutral group. e, A DD model of the yeast PIN. f, A DDR model of the yeast PIN.
See this image and copyright information in PMC

References

    1. Kurata H, Inoue K, Maeda K, Masaki K, Shimokawa Y, et al. Extended CADLIVE: a novel graphical notation for design of biochemical network maps and computational pathway analysis. Nucleic Acids Res. 2007;35:e134. - PMC - PubMed
    1. Adai AT, Date SV, Wieland S, Marcotte EM. LGL: creating a map of protein function with an algorithm for visualizing very large biological networks. J Mol Biol. 2004;340:179–190. - PubMed
    1. Li W, Kurata H. A grid layout algorithm for automatic drawing of biochemical networks. Bioinformatics. 2005;21:2036–2042. - PubMed
    1. Genc B, Dogrusoz U. A constrained, force-directed layout algorithm for biological pathways. Proceedings of the 11th International Symposium on Graph Drawing. 2003:314–319.
    1. Karp P, Paley S. Automated drawing metabolic pathways. Proceedings of the 3rd International Conference on Bioinformatics and Genome Research. 1994:225–238.

Publication types