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

Clearance Models: Compartment Models01:25

Clearance Models: Compartment Models

79
Clearance measures drug elimination from the central compartment, including plasma and highly perfused organs like kidneys and liver. Its calculation varies depending on pharmacokinetic models and administration routes. The one-compartment model, for instance, portrays the pharmacokinetics of polar drugs such as aminoglycoside antibiotics administered intravenously and readily excreted in urine. In this case, clearance is influenced by the terminal rate constant (λz) and the total volume...
79
Small-signal Diode Model01:18

Small-signal Diode Model

831
In analyzing the behavior of diodes in circuits, the relationship between the current through a diode and the voltage across it is of particular interest, especially when considering the effect of a direct current (DC) bias voltage. When applied, this DC bias influences the diode's operating point, known as the Q point, around which the current-voltage (I-V) characteristic of the diode exhibits exponential behavior. Introducing a small, time-varying signal on top of this bias aids in...
831
Multicompartment Models: Overview01:14

Multicompartment Models: Overview

143
Multicompartment models are mathematical constructs that depict how drugs are distributed and eliminated within the body. They segment the body into several compartments, symbolizing various physiological or anatomical areas connected through drug transfer processes such as absorption, metabolism, distribution, and elimination.
These models offer a more comprehensive representation of drug behavior in the body than one-compartment models. They accommodate the complexity of drug distribution,...
143
Statically Indeterminate Problem Solving01:16

Statically Indeterminate Problem Solving

378
Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...
378
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

54
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...
54
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation01:24

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

498
This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...
498

You might also read

Related Articles

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

Sort by
Same author

Closing the Complexity Gap of the Double Distance Problem.

IEEE transactions on computational biology and bioinformatics·2025
Same author

Reconstructing rearrangement phylogenies of natural genomes.

Algorithms for molecular biology : AMB·2025
Same author

Applying rearrangement distances to enable plasmid epidemiology with pling.

Microbial genomics·2024
Same author

The Floor Is Lava: Halving Natural Genomes with Viaducts, Piers, and Pontoons.

Journal of computational biology : a journal of computational molecular cell biology·2024
Same author

HaploBlocks: Efficient Detection of Positive Selection in Large Population Genomic Datasets.

Molecular biology and evolution·2023
Same author

Computing the Rearrangement Distance of Natural Genomes.

Journal of computational biology : a journal of computational molecular cell biology·2021

Related Experiment Video

Updated: Jul 2, 2025

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
10:44

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Published on: December 7, 2021

2.1K

Recombinations, chains and caps: resolving problems with the DCJ-indel model.

Leonard Bohnenkämper1

  • 1Faculty of Technology and Center for Biotechnology (CeBiTec), Bielefeld University, Universitätsstraße 25, 33615, Bielefeld, NRW, Germany. lbohnenkaemper@techfak.uni-bielefeld.de.

Algorithms for Molecular Biology : AMB
|February 28, 2024
PubMed
Summary

This study presents a new method for the genomic distance problem using the Double Cut and Join-indel model, improving computational efficiency for complex genomes.

Keywords:
CappingComparative genomicsDouble-cut-and-joinGenome rearrangementIndelsInteger linear programming

More Related Videos

Expedited Radiation Biodosimetry by Automated Dicentric Chromosome Identification ADCI and Dose Estimation
10:33

Expedited Radiation Biodosimetry by Automated Dicentric Chromosome Identification ADCI and Dose Estimation

Published on: September 4, 2017

15.7K
In Vivo Modeling of the Morbid Human Genome using Danio rerio
12:31

In Vivo Modeling of the Morbid Human Genome using Danio rerio

Published on: August 24, 2013

20.7K

Related Experiment Videos

Last Updated: Jul 2, 2025

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
10:44

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Published on: December 7, 2021

2.1K
Expedited Radiation Biodosimetry by Automated Dicentric Chromosome Identification ADCI and Dose Estimation
10:33

Expedited Radiation Biodosimetry by Automated Dicentric Chromosome Identification ADCI and Dose Estimation

Published on: September 4, 2017

15.7K
In Vivo Modeling of the Morbid Human Genome using Danio rerio
12:31

In Vivo Modeling of the Morbid Human Genome using Danio rerio

Published on: August 24, 2013

20.7K

Area of Science:

  • Genomics
  • Computational Biology
  • Bioinformatics

Background:

  • The genomic distance problem seeks the minimum rearrangements to transform one genome into another.
  • The Double Cut and Join (DCJ) model and its extension, the DCJ-indel model, are powerful tools for this problem.
  • Existing Integer Linear Programming (ILP) solutions face performance issues with numerous contigs due to 'capping'.

Purpose of the Study:

  • To reconcile disparate conceptualizations of the DCJ-indel model.
  • To develop a novel ILP solution for the genomic distance problem that avoids capping.
  • To improve computational performance for genomes with many contigs.

Main Methods:

  • Applying a new conceptualization of the DCJ-indel model to the distance problem.
  • Deriving a novel ILP formulation that bypasses the capping technique.
  • Evaluating the new ILP solution on simulated and real genomic data.

Main Results:

  • The study uncovers the relationship between different DCJ-indel model conceptualizations.
  • A new ILP solution significantly enhances performance on genomes with high contig numbers.
  • The method maintains exactness and competitive performance on other genome types.

Conclusions:

  • The novel ILP approach offers a more efficient and scalable solution for the genomic distance problem.
  • This work bridges theoretical gaps in DCJ-indel model understanding.
  • The improved method has practical implications for analyzing complex genomes, as demonstrated with Drosophila data.