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

Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

270
The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
270
Uniform Depth Channel Flow: Problem Solving01:18

Uniform Depth Channel Flow: Problem Solving

116
To calculate the flow rate for a trapezoidal channel, first, identify the bottom width, side slope, and flow depth of the channel. The cross-sectional area (A) corresponding to the depth of flow (y), channel bottom width (B), and side slope (θ) is determined by:Next, calculate the wetted perimeter, which includes the bottom width and the sloped side lengths in contact with the water. Using the values of the cross-sectional area and the wetted perimeter, determine the hydraulic radius by...
116
The Power Flow Problem and Solution01:26

The Power Flow Problem and Solution

316
Power flow problem analysis is fundamental for determining real and reactive power flows in network components, such as transmission lines, transformers, and loads. The power system's single-line diagram provides data on the bus, transmission line, and transformer. Each bus k in the system is characterized by four key variables: voltage magnitude Vk​, phase angle δk​, real power Pk​, and reactive power Qk​. Two of these four variables are inputs, while the...
316
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

98
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...
98
Laminar Flow: Problem Solving01:24

Laminar Flow: Problem Solving

238
Laminar flow occurs when a fluid moves smoothly in parallel layers with minimal mixing and turbulence. In fluid mechanics, ensuring laminar flow within a pipe is essential for precise control of flow characteristics, especially in engineering applications. The key factor in determining whether flow remains laminar is the Reynolds number, a dimensionless quantity that depends on the fluid's velocity, density, viscosity, and the pipe's diameter. A Reynolds number of 2100 or lower...
238
Turbulent Flow: Problem Solving01:09

Turbulent Flow: Problem Solving

174
Carbonation is a process used to dissolve carbon dioxide gas in a liquid, commonly used in the production of carbonated beverages. Achieving efficient carbonation requires careful control of temperature, pressure, and flow conditions. By adjusting these parameters, carbonation efficiency can be maximized, producing a higher concentration of CO2 in the liquid.
Temperature is a key factor in CO2 solubility. In this case, the CO2 gas and the liquid are cooled to 20°C. Lower temperatures...
174

You might also read

Related Articles

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

Sort by
Same author

EssentCell: Discovering Essential Evolutionary Relations in Noisy Single-Cell Data.

IEEE transactions on computational biology and bioinformatics·2026
Same author

A Faithful Discretization of Verbose Directional Transforms.

Discrete & computational geometry·2026
Same author

Minimum flow decomposition in graphs with cycles using integer linear programming.

Journal of global optimization : an international journal dealing with theoretical and computational aspects of seeking global optima and their applications in science, management and engineering·2025
Same author

A spatial long-read approach at near-single-cell resolution reveals developmental regulation of splicing and polyadenylation sites in distinct cortical layers and cell types.

Nature communications·2025
Same author

Spatial isoform sequencing at sub-micrometer single-cell resolution reveals novel patterns of spatial isoform variability in brain cell types.

bioRxiv : the preprint server for biology·2025
Same author

A spatial long-read approach at near-single-cell resolution reveals developmental regulation of splicing and polyadenylation sites in distinct cortical layers and cell types.

bioRxiv : the preprint server for biology·2025
Same journal

GMSA: A Graph Matching and Point Cloud Registration-Based Method for Spatial Transcriptomics Data Alignment.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Investigations on Multiple Protein Scaffold Filling.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Cell Type Prediction for Single-Cell RNA Sequencing Utilizing Unsupervised Domain Adaptation and Semi-Supervised Learning.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

PPIGAN: Prediction of Protein-Protein Interactions Using Generative Adversarial Networks.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Deep Structure-Enhanced Cell Clustering Model for Single-Cell RNA Sequencing Data.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Asymmetric Drug-Drug Interaction Prediction Based on Generative Adversarial Networks and Knowledge Graph.

Journal of computational biology : a journal of computational molecular cell biology·2026
See all related articles

Related Experiment Video

Updated: Aug 25, 2025

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules
10:58

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules

Published on: July 25, 2013

17.1K

Efficient Minimum Flow Decomposition via Integer Linear Programming.

Fernando H C Dias1, Lucia Williams2, Brendan Mumey2

  • 1Department of Computer Science, University of Helsinki, Helsinki, Finland.

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|October 19, 2022
PubMed
Summary
This summary is machine-generated.

We present a fast, exact solver for minimum flow decomposition (MFD) in acyclic networks using Integer Linear Programming. This approach efficiently handles complex RNA assembly problems by encoding all paths with fewer variables.

Keywords:
flow decompositioninteger linear programmingmultiassembly and RNA assemblynetwork flow

More Related Videos

Design and Optimization Strategies of a High-Performance Vented Box
14:23

Design and Optimization Strategies of a High-Performance Vented Box

Published on: June 9, 2023

1.2K
Author Spotlight: Integrating Computational and Experimental Approaches in Precision Oncology
07:03

Author Spotlight: Integrating Computational and Experimental Approaches in Precision Oncology

Published on: December 1, 2023

1.0K

Related Experiment Videos

Last Updated: Aug 25, 2025

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules
10:58

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules

Published on: July 25, 2013

17.1K
Design and Optimization Strategies of a High-Performance Vented Box
14:23

Design and Optimization Strategies of a High-Performance Vented Box

Published on: June 9, 2023

1.2K
Author Spotlight: Integrating Computational and Experimental Approaches in Precision Oncology
07:03

Author Spotlight: Integrating Computational and Experimental Approaches in Precision Oncology

Published on: December 1, 2023

1.0K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Network Flow Algorithms

Background:

  • Minimum Flow Decomposition (MFD) is an NP-hard problem crucial for bioinformatics, particularly RNA assembly.
  • Existing tools often use heuristics or simplified models, leading to non-minimal or imperfect flow decompositions.
  • The complexity of MFD hinders exact solutions for practical applications.

Purpose of the Study:

  • To develop the first fast and exact solver for Minimum Flow Decomposition on acyclic flow networks.
  • To provide an efficient Integer Linear Programming formulation for MFD and its variants.
  • To enable more accurate and minimal solutions for complex bioinformatics problems like RNA assembly.

Main Methods:

  • Developed an Integer Linear Programming (ILP) formulation for MFD on acyclic networks.
  • Introduced a novel encoding strategy using a quadratic number of variables to represent exponentially many solution paths.
  • Extended the ILP formulation to address practical variants, including read length and error minimization.

Main Results:

  • Achieved the first fast and exact solution for MFD on acyclic flow networks.
  • Demonstrated the solver's efficiency, solving all tested instances (simulated and real) in under 13 seconds.
  • Successfully encoded all exponentially many solution paths using only a quadratic number of variables.

Conclusions:

  • The proposed ILP-based approach offers a significant advancement for solving Minimum Flow Decomposition exactly and efficiently.
  • This method provides a foundation for developing more accurate and practical RNA assembly tools.
  • The freely available implementation facilitates future research and application in bioinformatics.