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 Concept Videos

Protein Networks02:26

Protein Networks

4.7K
An organism can have thousands of different proteins, and these proteins must cooperate to ensure the health of an organism. Proteins bind to other proteins and form complexes to carry out their functions. Many proteins interact with multiple other proteins creating a complex network of protein interactions.
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
4.7K
Protein Networks02:26

Protein Networks

2.9K
2.9K
Cluster Sampling Method01:20

Cluster Sampling Method

15.6K
Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
15.6K
Protein-protein Interfaces02:04

Protein-protein Interfaces

15.0K
Many proteins form complexes to carry out their functions, making protein-protein interactions (PPIs) essential for an organism's survival. Most PPIs are stabilized by numerous weak noncovalent chemical forces. The physical shape of the interfaces determines the way two proteins interact. Many globular proteins have closely-matching shapes on their surfaces, which form a large number of weak bonds. Additionally, many PPIs occur between two helices or between a surface cleft and a...
15.0K

You might also read

Related Articles

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

Sort by
Same author

Combining Clickstream Analyses and Graph-Modeled Data Clustering for Identifying Common Response Processes.

Psychometrika·2021
Same author

Stable roommates with narcissistic, single-peaked, and single-crossing preferences.

Autonomous agents and multi-agent systems·2020
Same author

Matching algorithms for assigning orthologs after genome duplication events.

Computational biology and chemistry·2018
Same author

Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems.

Methods in molecular biology (Clifton, N.J.)·2016
Same author

A graph modification approach for finding core-periphery structures in protein interaction networks.

Algorithms for molecular biology : AMB·2015
Same author

An analytical approach to network motif detection in samples of networks with pairwise different vertex labels.

Computational and mathematical methods in medicine·2012
Same journal

circ2DGNN: circRNA-Disease Association Prediction via Transformer-Based Graph Neural Network.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Hierarchical Hypergraph Learning in Association- Weighted Heterogeneous Network for miRNA- Disease Association Identification.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Discriminative Domain Adaption Network for Simultaneously Removing Batch Effects and Annotating Cell Types in Single-Cell RNA-Seq.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

MLW-BFECF: A Multi-Weighted Dynamic Cascade Forest Based on Bilinear Feature Extraction for Predicting the Stage of Kidney Renal Clear Cell Carcinoma on Multi-Modal Gene Data.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

An End-to-End Knowledge Graph Fused Graph Neural Network for Accurate Protein-Protein Interactions Prediction.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Generative Biomedical Event Extraction With Constrained Decoding Strategy.

IEEE/ACM transactions on computational biology and bioinformatics·2024
See all related articles

Related Experiment Video

Updated: Apr 4, 2026

Modeling the Functional Network for Spatial Navigation in the Human Brain
05:55

Modeling the Functional Network for Spatial Navigation in the Human Brain

Published on: October 13, 2023

1.6K

Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage.

Falk Hüffner, Christian Komusiewicz, Adrian Liebtrau

    IEEE/ACM Transactions on Computational Biology and Bioinformatics
    |September 11, 2015
    PubMed
    Summary
    This summary is machine-generated.

    We introduce Highly Connected Deletion, a new method for finding highly connected components in biological networks. This approach improves upon existing algorithms by identifying more clusters and optimizing edge removal for better network analysis.

    More Related Videos

    Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks
    09:49

    Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks

    Published on: September 25, 2021

    4.9K
    JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics
    07:28

    JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics

    Published on: October 19, 2021

    3.7K

    Related Experiment Videos

    Last Updated: Apr 4, 2026

    Modeling the Functional Network for Spatial Navigation in the Human Brain
    05:55

    Modeling the Functional Network for Spatial Navigation in the Human Brain

    Published on: October 13, 2023

    1.6K
    Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks
    09:49

    Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks

    Published on: September 25, 2021

    4.9K
    JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics
    07:28

    JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics

    Published on: October 19, 2021

    3.7K

    Area of Science:

    • Computational Biology
    • Graph Theory
    • Network Science

    Background:

    • Existing algorithms for biological network clustering, like Hartuv and Shamir's, identify nonoverlapping highly connected components.
    • There is a need for methods that can optimize the removal of edges to achieve highly connected components in complex networks.

    Purpose of the Study:

    • To introduce and analyze the combinatorial optimization problem Highly Connected Deletion.
    • To develop efficient algorithms and solution strategies for identifying highly connected components in biological networks.
    • To improve upon existing clustering methods for biological networks.

    Main Methods:

    • Formulating Highly Connected Deletion as an NP-hard problem.
    • Developing a fixed-parameter algorithm and a kernelization for the problem.
    • Proposing exact and heuristic solution strategies using data reduction rules and integer linear programming with column generation.

    Main Results:

    • Highly Connected Deletion is proven to be NP-hard.
    • Data reduction rules identify approximately 75% of edges for deletion in optimal solutions.
    • A column generation method optimally solves protein interaction networks up to 6,000 vertices and 13,500 edges within five hours.
    • A new heuristic finds more clusters than the Hartuv and Shamir method.

    Conclusions:

    • The Highly Connected Deletion problem offers a powerful framework for analyzing biological networks.
    • The proposed algorithms and solution strategies provide efficient and scalable methods for network clustering.
    • The new heuristic enhances the discovery of biological network modules compared to previous approaches.