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

Calculation of Electric Flux01:25

Calculation of Electric Flux

3.2K
Consider the electric field of an oppositely charged, parallel-plate system and an imaginary box between those plates. Let the bottom face of the box be ABCD, and the top face be FGHK. The electric field between the plates is uniform and points from the positive plate toward the negative plate. The calculation of this field's flux through the box's various faces shows that the net flux through the box is zero. Why does the flux cancel out here?
3.2K
Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

18.6K
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...
18.6K
Hückel's Rule Diagram of π MOs: Frost Circle01:08

Hückel's Rule Diagram of π MOs: Frost Circle

6.2K
The Frost circle or the inscribed polygon method is a graphical method for determining the relative energies of π molecular orbitals (MOs) for planar, fully conjugated, and monocyclic compounds. This method was first described by A. A. Frost and Boris Musulin in 1953.
A Frost circle is constructed by drawing a polygon whose number of edges is equal to the number of carbons of the given cyclic system, with one of the vertices pointing down. Then, a circle is drawn enclosing the polygon so that...
6.2K
Design Example: Traverse Angle Computations01:25

Design Example: Traverse Angle Computations

408
Traverse angle computations are a critical component of surveying, used to compute the internal angles within a closed traverse. A traverse consists of a series of connected lines forming a closed loop, often used for land boundary delineation or mapping. Calculating the internal angles ensures accuracy in the traverse geometry and is essential for checking survey data integrity.The process begins with known azimuths and bearings of the traverse sides. Internal angles at each vertex are...
408
Mesh Analysis01:20

Mesh Analysis

1.7K
Mesh analysis is a valuable method for simplifying circuit analysis using mesh currents as key circuit variables. Unlike nodal analysis, which focuses on determining unknown voltages, mesh analysis applies Kirchhoff's voltage law (KVL) to find unknown currents within a circuit. This method is particularly convenient in reducing the number of simultaneous equations that need to be solved.
A fundamental concept in mesh analysis is the definition of meshes and mesh currents. A mesh is a closed...
1.7K
Vector Algebra: Method of Components01:08

Vector Algebra: Method of Components

20.4K
It is cumbersome to find the magnitudes of vectors using the parallelogram rule or using the graphical method to perform mathematical operations like addition, subtraction, and multiplication. There are two ways to circumvent this algebraic complexity. One way is to draw the vectors to scale, as in navigation, and read approximate vector lengths and angles (directions) from the graphs. The other way is to use the method of components.
In many applications, the magnitudes and directions of...
20.4K

You might also read

Related Articles

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

Sort by
Same author

General Intelligence-Based Fragmentation (GIF): A Framework for Peak-Labeled Spectra Simulation.

Analytical chemistry·2026
Same author

Pixelomics: The Omics-Style Interrogation of Whole Slide Images for Precision Pathology.

Advances in anatomic pathology·2026
Same author

Updates on Digital Pathology and Artificial Intelligence for Clinical Applications in Surgical Pathology.

Advances in anatomic pathology·2026
Same author

Challenges and Barriers in Implementing AI for Clinical Applications in Anatomic Pathology.

Advances in anatomic pathology·2026
Same author

Authors' Reply: Advancing Digital Pathology With Large Language Models.

Advances in anatomic pathology·2026
Same author

Comprehensive genomic analysis of non-BRCA familial breast cancer in an Arab population.

NPJ breast cancer·2026
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: Mar 25, 2026

Network Analysis of Foramen Ovale Electrode Recordings in Drug-resistant Temporal Lobe Epilepsy Patients
09:32

Network Analysis of Foramen Ovale Electrode Recordings in Drug-resistant Temporal Lobe Epilepsy Patients

Published on: December 18, 2016

13.1K

gEFM: An Algorithm for Computing Elementary Flux Modes Using Graph Traversal.

Ehsan Ullah, Shuchin Aeron, Soha Hassoun

    IEEE/ACM Transactions on Computational Biology and Bioinformatics
    |February 18, 2016
    PubMed
    Summary
    This summary is machine-generated.

    We developed graphical Elementary Flux Mode (gEFM) analysis, a novel algorithm for efficiently enumerating metabolic pathways. This computational method aids in engineering cellular metabolism for applications like biofuel production and cancer therapy.

    More Related Videos

    Finite Element Modelling of a Cellular Electric Microenvironment
    08:23

    Finite Element Modelling of a Cellular Electric Microenvironment

    Published on: May 18, 2021

    4.1K
    Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
    13:44

    Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

    Published on: August 30, 2013

    43.8K

    Related Experiment Videos

    Last Updated: Mar 25, 2026

    Network Analysis of Foramen Ovale Electrode Recordings in Drug-resistant Temporal Lobe Epilepsy Patients
    09:32

    Network Analysis of Foramen Ovale Electrode Recordings in Drug-resistant Temporal Lobe Epilepsy Patients

    Published on: December 18, 2016

    13.1K
    Finite Element Modelling of a Cellular Electric Microenvironment
    08:23

    Finite Element Modelling of a Cellular Electric Microenvironment

    Published on: May 18, 2021

    4.1K
    Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
    13:44

    Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

    Published on: August 30, 2013

    43.8K

    Area of Science:

    • Systems Biology
    • Metabolic Engineering
    • Computational Biology

    Background:

    • Computational methods are crucial for engineering cellular metabolism, impacting pharmaceuticals, gene therapy, cancer treatment, and biofuels.
    • Elementary Flux Mode (EFM) analysis is a key technique for understanding cell growth, regulation, product yield, and network robustness.
    • EFM analysis is computationally intensive due to the need to enumerate all independent, stoichiometrically balanced pathways in cellular networks.

    Purpose of the Study:

    • To present a novel algorithm, graphical EFM (gEFM), for enumerating Elementary Flux Modes.
    • To demonstrate the effectiveness and efficiency of gEFM compared to existing EFM computation tools.

    Main Methods:

    • Developed the gEFM algorithm based on graph traversal, an approach previously considered unsuitable for EFM enumeration.
    • Derived the algorithm from a pathway synthesis method by Mavrovouniotis et al.
    • Applied gEFM to various networks, reporting runtimes and comparing performance with other EFM tools, including analysis of network compression benefits.

    Main Results:

    • gEFM demonstrates competitive performance against state-of-the-art EFM computational techniques on several networks.
    • The algorithm's efficiency is enhanced through network compression.
    • While sensitive to constraint ordering, gEFM benefits from utilizing underlying network structure for improved ordering.

    Conclusions:

    • gEFM offers a viable and efficient alternative for Elementary Flux Mode enumeration in metabolic engineering.
    • The graphical approach provides a new perspective on tackling the computational challenges of EFM analysis.
    • Further optimization may be needed for networks with a very large number of EFMs.