Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

A fast layout algorithm for protein interaction networks.

Kyungsook Han1, Byong-Hyon Ju

  • 1School of Computer Science & Engineering, Inha University, Inchon 402-751, Korea. khan@inha.ac.kr

Bioinformatics (Oxford, England)
|October 14, 2003
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

MetaCancerDB: a database of site-specific RNA-miRNA correlations in cancer metastasis.

Database : the journal of biological databases and curation·2026
Same author

A perturbed multilayer perceptron approach to predicting distant metastatic sites of cancer patients.

Computational biology and chemistry·2026
Same author

Predicting distant cancer metastasis using a weighted gene interaction network and sample-specific differential correlations.

Journal of bioinformatics and computational biology·2026
Same author

DAPL1 is activated by Np63 and GRα and regulates lipid metabolism.

Journal of molecular medicine (Berlin, Germany)·2026
Same author

Predicting Cancer Metastasis From DNA Methylation and Gene Expression Profiles.

IEEE transactions on computational biology and bioinformatics·2025
Same author

Predicting distant metastatic sites of cancer using perturbed correlations of miRNAs with competing endogenous RNAs.

Computational biology and chemistry·2025
Same journal

MCFST: Spatial domain identification method based on multi-view graph convolutional network and graph fusion network.

Bioinformatics (Oxford, England)·2026
Same journal

SpaBiT: Enhancing Spatial Transcriptomics Resolution via Bidirectional Attention Transformers.

Bioinformatics (Oxford, England)·2026
Same journal

EDEL: Enhancing Dense Retrievers for Curation of Biomedical Knowledge Bases.

Bioinformatics (Oxford, England)·2026
Same journal

Informative Relational Learning for Adverse Reaction Prediction with Enhanced Generalization to Novel Drugs.

Bioinformatics (Oxford, England)·2026
Same journal

An interpretable deep learning framework uncovers features governing CRISPR-Cas9 genome-editing efficiency.

Bioinformatics (Oxford, England)·2026
Same journal

3DICE: Interpretable 3D Cross-Modal Learning for Drug-Target Interaction Prediction and Large-Scale Drug Discovery.

Bioinformatics (Oxford, England)·2026
See all related articles

We developed a fast 3D graph drawing algorithm for large protein interaction networks. This new method significantly improves visualization and analysis of complex biological data.

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Network Science

Background:

  • Graph drawing algorithms are essential for visualizing relational data.
  • Large-scale graphs, like protein interaction networks, pose significant challenges for naive visualization algorithms.

Purpose of the Study:

  • To develop an extremely fast layout algorithm for visualizing large-scale protein interaction networks in 3D space.
  • To overcome the limitations of existing graph drawing methods for complex biological networks.

Main Methods:

  • The algorithm employs a multi-stage approach: (1) layout of connected components, (2) global node layout relative to pivot nodes, and (3) local refinement using midnode and neighbor relocation.
  • It refines layouts by considering nodes within a distance of 2.

Related Experiment Videos

Main Results:

  • The developed algorithm is an order of magnitude faster than classical graph drawing methods.
  • It enables direct visualization of data from protein interaction databases.
  • The algorithm facilitates abstraction and comparison operations for effective analysis of large networks.

Conclusions:

  • This novel algorithm offers a significant advancement in visualizing and analyzing large-scale protein interaction networks.
  • Its speed and analytical features make it a valuable tool for bioinformatics research.