Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Evolutionary Relationships through Genome Comparisons

Evolutionary Relationships through Genome Comparisons

Genome comparison is one of the excellent ways to interpret the evolutionary relationships between organisms. The basic principle of genome comparison is that if two species share a common feature, it is likely encoded by the DNA sequence conserved between both species. The advent of genome sequencing technologies in the late 20th century enabled scientists to understand the concept of conservation of domains between species and helped them to deduce evolutionary relationships across diverse...

DNA Microarrays

DNA Microarrays

Microarrays are high-throughput and relatively inexpensive assays that can be automated to analyze large quantities of data at a time. They are used in genome-wide studies to compare gene or protein expression under two varied conditions, such as healthy and diseased states. Microarrays consist of glass or silica slides on which probe molecules are covalently attached through surface functionalization. Most commonly, the slides are prepared through the chemisorption of silanes to silica...

You might also read

Related Articles

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

Sort by

Same author

Progressive suppression of regulated cell death defines terminal macrophage states in liver cirrhosis.

Annals of medicine·2026

Same author

Investigations on Multiple Protein Scaffold Filling.

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

Same author

Electrolyte-Regulated Epitaxial-Like Gradient Interface for Stable 4.8 V LiCoO<sub>2</sub>.

Journal of the American Chemical Society·2026

Same author

Persistent dysbiosis of intestinal and oral microbiota after neoadjuvant radiotherapy for rectal cancer: Implications for surgery and microbiome intervention.

Frontiers in oncology·2026

Same author

Fueling the fire: aspartate deficiency primes and fuels STING activation.

The Journal of clinical investigation·2026

Same author

MPU-rPPG: A Comprehensive and High-Fidelity Dataset for Remote Photoplethysmography Across Diverse Conditions and Demographics.

Scientific data·2026

Same journal

conMItion: an R package adjusting confounding factors for associations in multi-omics.

Bioinformatics (Oxford, England)·2026

Same journal

SpaMFG: a Spatial Multi-omics Integration Method based on Feature Grouping.

Bioinformatics (Oxford, England)·2026

Same journal

CSCN: Inference of Cell-Specific Causal Networks Using Single-Cell RNA-Seq Data.

Bioinformatics (Oxford, England)·2026

Same journal

Sparse CCA-Based Mediation Analysis with High-Dimensional Exposures and Mediators.

Bioinformatics (Oxford, England)·2026

Same journal

Enhancing Cross-Context Generalization in Drug Perturbation Prediction with a Multimodal Conditional Diffusion Framework.

Bioinformatics (Oxford, England)·2026

Same journal

Primer Design through Submodular Function Estimation.

Bioinformatics (Oxford, England)·2026

See all related articles

Search research articles

Related Experiment Video

Updated: Jun 6, 2026

Flow-sorting and Exome Sequencing of the Reed-Sternberg Cells of Classical Hodgkin Lymphoma

Flow-sorting and Exome Sequencing of the Reed-Sternberg Cells of Classical Hodgkin Lymphoma

Published on: June 10, 2017

Algorithms for sorting unsigned linear genomes by the DCJ operations.

Haitao Jiang¹, Binhai Zhu, Daming Zhu

¹Department of Computer Science, Montana State University, Bozeman, MT 59717, USA.

Bioinformatics (Oxford, England)

|December 8, 2010

Summary

This summary is machine-generated.

This study introduces a 1.5-approximation algorithm for unsigned double cut and join (UDCJ) distance in unsigned linear multichromosomal genomes. It also presents a fixed-parameter tractable algorithm for UDCJ, improving computational efficiency for genomic rearrangement analysis.

More Related Videos

Detection of Copy Number Alterations Using Single Cell Sequencing

Detection of Copy Number Alterations Using Single Cell Sequencing

Published on: February 17, 2017

Generation of Genome-wide Chromatin Conformation Capture Libraries from Tightly Staged Early Drosophila Embryos

Generation of Genome-wide Chromatin Conformation Capture Libraries from Tightly Staged Early Drosophila Embryos

Published on: October 3, 2018

Related Experiment Videos

Last Updated: Jun 6, 2026

Flow-sorting and Exome Sequencing of the Reed-Sternberg Cells of Classical Hodgkin Lymphoma

Flow-sorting and Exome Sequencing of the Reed-Sternberg Cells of Classical Hodgkin Lymphoma

Published on: June 10, 2017

Detection of Copy Number Alterations Using Single Cell Sequencing

Detection of Copy Number Alterations Using Single Cell Sequencing

Published on: February 17, 2017

Generation of Genome-wide Chromatin Conformation Capture Libraries from Tightly Staged Early Drosophila Embryos

Generation of Genome-wide Chromatin Conformation Capture Libraries from Tightly Staged Early Drosophila Embryos

Published on: October 3, 2018

Area of Science:

Computational Biology
Genomics
Bioinformatics

Background:

The double cut and join (DCJ) operation is fundamental for analyzing genomic rearrangements.
Existing research extensively covers DCJ distance for signed genomes but lacks efficient solutions for unsigned multichromosomal genomes.
The unsigned DCJ (UDCJ) distance problem for linear multichromosomal genomes remains computationally challenging.

Purpose of the Study:

To address the computational complexity of the unsigned DCJ distance for linear multichromosomal genomes.
To develop novel algorithms for accurately calculating UDCJ distance.
To advance the understanding of genomic rearrangement analysis in unsigned multichromosomal systems.

Main Methods:

Devised a 1.5-approximation algorithm for UDCJ by leveraging the distance formula for signed genomes.
Established that UDCJ admits a weak kernel of size 2k.
Developed a fixed-parameter tractable (FPT) algorithm with a runtime of O(2(2k)n).

Main Results:

A 1.5-approximation algorithm for computing UDCJ distance was successfully developed.
The study demonstrated the existence of a weak kernel for UDCJ, enabling FPT algorithms.
An efficient FPT algorithm for UDCJ was presented, offering significant computational improvements.

Conclusions:

The developed algorithms provide efficient solutions for the UDCJ distance problem in unsigned linear multichromosomal genomes.
This research contributes to more accurate and scalable genomic rearrangement analysis.
The findings pave the way for further advancements in comparative genomics and evolutionary studies.