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

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

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

Interactions Between Signaling Pathways

Interactions Between Signaling Pathways

Signaling cascades usually lack linearity. Multiple pathways interact and regulate one another, allowing cells to integrate and respond to diverse environmental stimuli.
Convergence and divergence, and cross-talk between signaling pathways
Two distinct signaling pathways can converge on a single functional unit, which may either be a single protein or a complex of proteins. The response is either functionally distinct or synergistic between the two pathways but different from the response...

IP3/DAG Signaling Pathway

IP3/DAG Signaling Pathway

Membrane lipids such as phosphatidylinositol (PI) are precursors for several membrane-bound and soluble second messengers. Specific kinases phosphorylate PI and produce phosphorylated inositol phospholipids. One such inositol phospholipids are the phosphatidylinositol-4,5 bisphosphate [PI(4,5)P2], present in the inner half of the lipid bilayer. Upon ligand binding, GPCR stimulates Gq proteins to turn on phospholipase Cꞵ. Activated phospholipase Cꞵ cleaves PI(4,5)P2 and produces two-second...

Cyclic Processes And Isolated Systems

Cyclic Processes And Isolated Systems

A thermodynamic system with zero heat exchange and work is an isolated system. For these systems, the internal energy remains constant.
In the case of a non-isolated system, the change in the internal energy is zero only if the process is cyclic. A thermodynamic process is considered cyclic if the system undergoes a series of changes and returns to its initial state.
Consider a cyclic process that returns to its initial state, undergoing a four-step process. The heat transfer along each path...

Graphs of Two-Variable Functions

Graphs of Two-Variable Functions

A weather map provides a practical example of a function of two variables. Across a wide region such as the United States, temperatures vary from one location to another. Each location can be identified by two geographic coordinates: longitude and latitude. Since a single temperature value is assigned to each coordinate pair, the situation can be represented mathematically as a function with two inputs and one output.In mathematical notation, longitude and latitude can be labeled as x and y,...

You might also read

Related Articles

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

Sort by

Same author

Thermodynamic metabolic modeling of growth and bioproduction potential of the acetogen <i>Acetobacterium woodii</i> with and without redox cofactor swaps.

Synthetic and systems biotechnology·2026

Same author

LumbriCyc: towards metabolic modelling of earthworms.

NPJ systems biology and applications·2026

Same author

COBRA-k: A powerful framework bridging constraint-based and kinetic metabolic modeling.

Science advances·2026

Same author

Minimal cut sets in metabolic networks: from conceptual foundations to applications in metabolic engineering and biomedicine.

Briefings in bioinformatics·2025

Same author

A novel engineered strain of Methylorubrum extorquens for methylotrophic production of glycolic acid.

Microbial cell factories·2024

Same author

Model-based optimization of cell-free enzyme cascades exemplified for the production of GDP-fucose.

Metabolic engineering·2024

Same journal

Covariance decomposition for distance based species tree estimation.

BMC bioinformatics·2026

Same journal

SNPio: a Python interface for population genomic data processing.

BMC bioinformatics·2026

Same journal

SpaHNR: a spatial domain identification method via sparse attention-based hierarchical node representation and multi-view contrastive learning.

BMC bioinformatics·2026

Same journal

OpenIMC: an open-source platform for analyzing single-cell and spatial proteomics by imaging mass cytometry.

BMC bioinformatics·2026

Same journal

NAP: an open source pipeline for cross-domain microbiome profiling using Nanopore sequencing-derived amplicon data.

BMC bioinformatics·2026

Same journal

SurvGME: an R package for survival analysis with graphical and measurement error models.

BMC bioinformatics·2026

See all related articles

Search research articles

Related Experiment Video

Updated: Jun 22, 2026

A Web Tool for Generating High Quality Machine-readable Biological Pathways

A Web Tool for Generating High Quality Machine-readable Biological Pathways

Published on: February 8, 2017

Computing paths and cycles in biological interaction graphs.

Steffen Klamt¹, Axel von Kamp

¹Max Planck Institute for Dynamics of Complex Technical Systems, D-39106 Magdeburg, Germany. klamt@mpi-magdeburg.mpg.de

BMC Bioinformatics

|June 17, 2009

Summary

This summary is machine-generated.

This study introduces new algorithms for analyzing biological interaction graphs, focusing on shortest paths and cycles. These computational tools enhance systems biology research by improving the analysis of cellular networks.

More Related Videos

A Knowledge Graph Approach to Elucidate the Role of Organellar Pathways in Disease via Biomedical Reports

A Knowledge Graph Approach to Elucidate the Role of Organellar Pathways in Disease via Biomedical Reports

Published on: October 13, 2023

Related Experiment Videos

Last Updated: Jun 22, 2026

A Web Tool for Generating High Quality Machine-readable Biological Pathways

A Web Tool for Generating High Quality Machine-readable Biological Pathways

Published on: February 8, 2017

A Knowledge Graph Approach to Elucidate the Role of Organellar Pathways in Disease via Biomedical Reports

A Knowledge Graph Approach to Elucidate the Role of Organellar Pathways in Disease via Biomedical Reports

Published on: October 13, 2023

Area of Science:

Systems Biology
Computational Biology
Network Analysis

Background:

Interaction graphs model causal relationships in cellular networks.
Analyzing paths, cycles, and shortest signed paths is crucial for systems biology.
Existing computational methods for these problems are limited.

Purpose of the Study:

To develop and evaluate algorithms for enumerating paths and cycles in interaction graphs.
To address the NP-complete problem of computing shortest positive/negative paths.
To provide computational tools for systems biology network analysis.

Main Methods:

Reviewed and compared existing path and cycle enumeration algorithms.
Developed exact and approximate algorithms for shortest positive/negative paths.
Benchmarked algorithms on biological networks using the CellNetAnalyzer framework.

Main Results:

New algorithms demonstrate superiority over existing methods for path and cycle enumeration.
Exact shortest path computations are feasible for networks up to several hundred nodes.
An approximate algorithm with polynomial complexity provides near-exact results for larger networks.

Conclusions:

Novel algorithms enhance the analysis of biological interaction graphs.
The developed methods are crucial for understanding cellular network dynamics.
Implemented algorithms are available in the CellNetAnalyzer framework for academic use.