Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Vector Algebra: Graphical Method

Vector Algebra: Graphical Method

Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...

Wilcoxon Signed-Ranks Test for Matched Pairs

Wilcoxon Signed-Ranks Test for Matched Pairs

The Wilcoxon signed-rank test for matched pairs evaluates the null hypothesis by combining the ranks of differences with their signs. It essentially tests whether the median of the differences in a population of matched pairs is zero. Since the test incorporates more information than the sign test, it generally yields more trustable conclusions. This test also does not require the data to follow a normal distribution, but two conditions must be met for it to be applicable: (1) the data must...

Protein Networks

Protein Networks

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,...

You might also read

Related Articles

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

Sort by

Same author

VUScope: a mathematical model for evaluating image-based drug response measurements and predicting long-term incubation outcomes.

Bioinformatics (Oxford, England)·2026

Same author

Dynamic Mortality Risk Prediction in Myelodysplastic Syndromes Using Longitudinal Clinical Data.

JCO clinical cancer informatics·2025

Same author

Sequence-to-graph alignment based copy number calling using a network flow formulation.

bioRxiv : the preprint server for biology·2025

Same author

Extending the Bicriterion Approach for Anticlustering: Exact and Hybrid Approaches.

Psychometrika·2025

Same author

Anticlustering for sample allocation to minimize batch effects.

Cell reports methods·2025

Same author

Somatic Mutations in HLA Class Genes and Antigen-Presenting Molecules in Malignant Glioma.

Cancer immunology research·2025

Search research articles

Related Experiment Video

Updated: Jun 25, 2026

Modeling the Functional Network for Spatial Navigation in the Human Brain

Modeling the Functional Network for Spatial Navigation in the Human Brain

Published on: October 13, 2023

A new graph-based method for pairwise global network alignment.

Gunnar W Klau¹

¹CWI, P,O, Box 94079, 1090 GB Amsterdam, The Netherlands. gunnar.klau@cwi.nl

BMC Bioinformatics

|February 12, 2009

Summary

This study introduces a novel graph-based method for network alignment, proving its NP-hard nature. The approach guarantees optimal solutions for biological networks, outperforming existing heuristics.

Area of Science:

Computational Biology
Bioinformatics
Network Science

Background:

Network alignment is crucial for studying conserved biological network topology.
Comparing biological networks is computationally challenging, often leading to NP-hard problems.
Previous network alignment algorithms primarily relied on heuristics.

Purpose of the Study:

To develop a graph-based maximum structural matching formulation for pairwise global network alignment.
To address the computational complexity and NP-hard nature of network alignment problems.
To create a method that computes provably optimal network alignments.

Main Methods:

Introduced a graph-based maximum structural matching formulation.
Proved the NP-hardness of the pairwise global network alignment problem.

Related Experiment Videos

Last Updated: Jun 25, 2026

Modeling the Functional Network for Spatial Navigation in the Human Brain

Modeling the Functional Network for Spatial Navigation in the Human Brain

Published on: October 13, 2023

Developed a novel Lagrangian relaxation approach combined with branch-and-bound.

Main Results:

The proposed method computes provably optimal network alignments.
The Lagrangian relaxation approach serves as a powerful heuristic with quality guarantees.
The method demonstrates near-optimal solutions, surpassing pure heuristics.

Conclusions:

Computational experiments show the method is efficient for protein-protein interaction and metabolic networks.
The new approach offers advantages over existing pure heuristic methods.
The developed software is available within the LISA library.