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

The Distance Formula01:20

The Distance Formula

724
In geometry, measuring the direct distance between two points on a plane is essential in various practical and theoretical applications. Whether in navigation, engineering, or computer graphics, determining the shortest path between two locations involves using the distance formula. This formula is derived from the Pythagorean Theorem, which relates the lengths of the sides of a right triangle. On a coordinate plane, the horizontal and vertical distances between two points serve as the legs of...
724
Distance Problem01:29

Distance Problem

134
When an object's velocity changes over time, the total distance traveled can be determined by summing small displacement intervals over short increments. This approach approximates the true distance through numerical summation and the use of integral calculus. An estimate of the total displacement can be obtained by measuring velocity at regular intervals and multiplying each value by the corresponding time step.If a runner accelerates over the first three seconds of a race, speed measurements...
134
Long-patch Base Excision Repair01:02

Long-patch Base Excision Repair

8.3K
Since the discovery of the two BER pathways, there has been a debate about how a cell chooses one pathway over the other and the factors determining this selection. Numerous in vitro experiments have pointed out multiple determinants for the sub-pathway selection. These are:
8.3K
Chromatographic Resolution01:15

Chromatographic Resolution

2.4K
In chromatography, a solute moves through a chromatographic column and tends to spread, forming a Gaussian-shaped band. The longer the solute spends in the column, the broader the band becomes. The broadening can lead to overlaps within the column, affecting separation effectiveness.
The effectiveness of separation can be evaluated by determining the level of separation between two neighboring peaks in a chromatogram, which represents the individual components of a sample.
In chromatography,...
2.4K
Fixing Double-strand Breaks02:04

Fixing Double-strand Breaks

16.0K
The double-stranded structure of DNA has two major advantages. First, it serves as a safe repository of genetic information where one strand serves as the back-up in case the other strand is damaged. Second, the double-helical structure can be wrapped around proteins called histones to form nucleosomes, which can then be tightly wound to form chromosomes. This way, DNA chains up to 2 inches long can be contained within microscopic structures in a cell. A double-stranded break not only damages...
16.0K
Design Example: Measuring Distance Between Two Points with Obstructions01:10

Design Example: Measuring Distance Between Two Points with Obstructions

502
When measuring distances in areas with physical obstructions, such as a lake in a field, surveyors must employ techniques to calculate accurate lengths without direct line measurements. One effective method is the offset technique, which allows for precise distance estimation over inaccessible stretches.In this scenario, a surveyor must measure a side of an area that crosses a lake. Since the measuring tape cannot span the lake, the surveyor begins by establishing a baseline that aligns with...
502

You might also read

Related Articles

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

Sort by
Same author

Augmenting transcriptome annotations through the lens of splicing evolution.

Genome research·2026
Same author

Hash functions in nucleotide sequence analysis.

Genome research·2026
Same author

Minimum flow decomposition guided by saturating subflows.

bioRxiv : the preprint server for biology·2025
Same author

Amaranth: Enhanced Single-Cell Transcript Assembly via Discriminative Modeling of UMI Reads and Internal Reads.

bioRxiv : the preprint server for biology·2025
Same author

MELO-ED: learning locality-sensitive multi-embeddings for edit distance.

bioRxiv : the preprint server for biology·2025
Same author

Accurate Reconstruction of Circular RNAs from Complex Rolling Circular Long Reads with CircPlex.

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: Mar 24, 2026

Two Algorithms for High-throughput and Multi-parametric Quantification of Drosophila Neuromuscular Junction Morphology
12:29

Two Algorithms for High-throughput and Multi-parametric Quantification of Drosophila Neuromuscular Junction Morphology

Published on: May 3, 2017

11.2K

A Fast and Exact Algorithm for the Exemplar Breakpoint Distance.

Mingfu Shao1, Bernard M E Moret1

  • 1Laboratory for Computational Biology and Bioinformatics, School of Computer and Communication Sciences , École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland .

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|March 9, 2016
PubMed
Summary
This summary is machine-generated.

We developed a fast algorithm to calculate the exemplar breakpoint distance, addressing the challenge of duplicate genes in comparative genomics. This method significantly improves computational efficiency and accuracy for genome rearrangement analysis.

Keywords:
ILPbreakpoint distanceexemplarorthology assignment

More Related Videos

Author Spotlight: Deciphering Electrical Networks Behind Complex Brain Activities and Disorders
05:49

Author Spotlight: Deciphering Electrical Networks Behind Complex Brain Activities and Disorders

Published on: November 1, 2024

1.3K
Spotting Cheetahs: Identifying Individuals by Their Footprints
09:47

Spotting Cheetahs: Identifying Individuals by Their Footprints

Published on: May 1, 2016

15.4K

Related Experiment Videos

Last Updated: Mar 24, 2026

Two Algorithms for High-throughput and Multi-parametric Quantification of Drosophila Neuromuscular Junction Morphology
12:29

Two Algorithms for High-throughput and Multi-parametric Quantification of Drosophila Neuromuscular Junction Morphology

Published on: May 3, 2017

11.2K
Author Spotlight: Deciphering Electrical Networks Behind Complex Brain Activities and Disorders
05:49

Author Spotlight: Deciphering Electrical Networks Behind Complex Brain Activities and Disorders

Published on: November 1, 2024

1.3K
Spotting Cheetahs: Identifying Individuals by Their Footprints
09:47

Spotting Cheetahs: Identifying Individuals by Their Footprints

Published on: May 1, 2016

15.4K

Area of Science:

  • Computational genomics
  • Bioinformatics
  • Systems biology

Background:

  • Comparative genomics faces challenges in calculating genome distance due to duplicate genes, a problem that is NP-hard.
  • Exemplar-based methods, while useful, involve an NP-hard problem for selecting optimal exemplars.

Purpose of the Study:

  • To develop a fast and exact algorithm for computing the exemplar breakpoint distance.
  • To address the computational complexity of genome rearrangement analysis with duplicate genes.
  • To introduce a new algorithm for the intermediate breakpoint distance problem for ortholog assignment.

Main Methods:

  • Developed a novel exact algorithm for exemplar breakpoint distance based on new insights into genome rearrangements.
  • Evaluated algorithm performance on simulation data and compared it with a divide-and-conquer approach.
  • Created a new algorithm for the intermediate breakpoint distance problem and applied it to ortholog assignment.

Main Results:

  • The new algorithm significantly outperforms existing methods in speed and scalability for exemplar breakpoint distance calculation.
  • The intermediate breakpoint distance algorithm demonstrates comparable or slightly better accuracy than the state-of-the-art MSOAR method for ortholog assignment.
  • The algorithm shows substantial speed improvements over MSOAR in comparative analysis of mammalian genomes.

Conclusions:

  • The proposed algorithm offers a computationally efficient and accurate solution for the exemplar breakpoint distance problem in comparative genomics.
  • This work advances the field of genome rearrangement analysis and provides a more effective tool for ortholog assignment.
  • The findings suggest a new direction for understanding genome evolution and developing advanced bioinformatics tools.