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

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

442
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
442
Optimization Problems01:26

Optimization Problems

220
Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...
220
Multiple Comparison Tests01:13

Multiple Comparison Tests

3.5K
Multiple comparison test, abbreviated as MCT, is a post hoc analysis generally performed after comparing multiple samples with one or more tests. An MCT will help identify a significantly different sample among multiple samples or a factor among multiple factors.
It would be easy to compare two samples using a significance alpha level of 0.05. In other words, there is only one sample pair to be compared. However, it would be difficult to identify a significantly different sample if the number...
3.5K
Methods of Medium Optimization01:28

Methods of Medium Optimization

74
Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...
74
Critical Numbers and the Closed Interval Method01:21

Critical Numbers and the Closed Interval Method

230
Understanding the maximum and minimum values of a function is essential for analyzing its overall behavior. These values, often referred to as extrema, provide insight into how a function behaves across its domain. In mathematical terms, extrema can be either local—representing peaks and valleys within a limited region—or absolute, indicating the highest or lowest points over an entire interval.A function’s extrema occur at critical numbers, which are values in the domain...
230
Theorems of Pappus and Guldinus: Problem Solving01:12

Theorems of Pappus and Guldinus: Problem Solving

1.2K
Pappus and Guldinus's theorems are powerful mathematical principles that are used for finding the surface area and volume of composite shapes. For example, consider a cylindrical storage tank with a conical top. Finding the surface area or volume can be challenging for such complex shapes. These theorems are particularly useful in calculating the volume and surface area of such systems. Here, the cylindrical storage tank with a conical top can be broken down into two simple shapes: a...
1.2K

You might also read

Related Articles

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

Sort by
Same author

Optimization in Sparse 2D to Dense 3D Weakly Supervised Learning: Application to Multi-Label Segmentation of Large ex vivo MRI Data.

ArXiv·2026
Same author

Elementary vectors reveal minimal interactions in microbial communities.

Journal of the Royal Society, Interface·2026
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

Singular Value Decomposition-Based Coil Combination Improves the Accuracy and Noise-Robustness of Quantitative Susceptibility Maps.

medRxiv : the preprint server for health sciences·2026
Same author

Automatic multiple sclerosis lesion segmentation in the spinal cord using 3 T and 7 T MP2RAGE images.

Multiple sclerosis and related disorders·2026
Same author

Generalizable spinal cord multiple sclerosis lesion segmentation across MRI contrasts, protocols, and centers.

Multiple sclerosis (Houndmills, Basingstoke, England)·2026

Related Experiment Video

Updated: May 6, 2026

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

7.0K

Comparison and improvement of algorithms for computing minimal cut sets.

Christian Jungreuthmayer, Govind Nair, Steffen Klamt

  • 1Austrian Centre of Industrial Biotechnology, Vienna, Austria. juergen.zanghellini@acib.at.

BMC Bioinformatics
|November 7, 2013
PubMed
Summary

This study unifies two algorithms for finding genetic intervention strategies (cMCSs) by extending integer programming. Preprocessing significantly speeds up computations, with the adapted Berge algorithm outperforming the integer programming approach.

More Related Videos

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.1K
Machine Learning Algorithms for Early Detection of Bone Metastases in an Experimental Rat Model
07:15

Machine Learning Algorithms for Early Detection of Bone Metastases in an Experimental Rat Model

Published on: August 16, 2020

5.8K

Related Experiment Videos

Last Updated: May 6, 2026

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

7.0K
A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.1K
Machine Learning Algorithms for Early Detection of Bone Metastases in an Experimental Rat Model
07:15

Machine Learning Algorithms for Early Detection of Bone Metastases in an Experimental Rat Model

Published on: August 16, 2020

5.8K

Area of Science:

  • Systems Biology
  • Metabolic Engineering
  • Computational Biology

Background:

  • Constrained minimal cut sets (cMCSs) offer a framework for identifying genetic intervention strategies in metabolic networks.
  • Existing algorithms for computing cMCSs, namely the adapted Berge algorithm and binary integer programming, were not directly comparable.

Purpose of the Study:

  • To establish equivalence between the adapted Berge algorithm and binary integer programming for cMCS computation.
  • To introduce efficient preprocessing steps applicable to both algorithms.
  • To benchmark the performance of these enhanced algorithms.

Main Methods:

  • Extending the binary integer programming formulation to achieve equivalence with the adapted Berge algorithm.
  • Applying established integer programming preprocessing techniques.
  • Benchmarking computational performance on medium-scale metabolic models.

Main Results:

  • The extended integer programming approach demonstrates equivalence with the adapted Berge algorithm.
  • Preprocessing steps significantly accelerate the computation of cMCSs for both algorithms.
  • The adapted Berge algorithm exhibited superior numerical performance compared to the binary integer programming approach.

Conclusions:

  • The newly implemented algorithms, leveraging preprocessing, achieve a speed-up of at least one order of magnitude over existing methods.
  • The findings facilitate more efficient enumeration of genetic intervention strategies for metabolic network optimization.