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 Experiment Videos

Gene maps linearization using genomic rearrangement distances.

Guillaume Blin1, Eric Blais, Danny Hermelin

  • 1IGM-LabInfo, UMR CNRS 8049, Université Paris-Est, Marne-la-Vallée, France. gblin@univ-mlv.fr

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

Related Concept Videos

You might also read

Related Articles

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

Sort by
Same author

High Early Embryo Mortality and Low Hatching Success Observed in Aldabra Giant Tortoise Populations.

Ecology and evolution·2026
Same author

GraphyloVar: predicting the impact of non-coding variants using a multi-species sequence model.

Bioinformatics (Oxford, England)·2026
Same author

The notochord: development, disease and stem cell-based modelling.

Development (Cambridge, England)·2026
Same author

H3K27me3 spreading organizes canonical PRC1 chromatin architecture to regulate developmental programs.

Nature genetics·2026
Same author

FullSynesth: Syntenic Reconciliation of a Set of Consistent Gene Trees.

Theory of computing systems·2026
Same author

Telomere-to-telomere assembly detects genomic diversity in Canadian strains of Borrelia burgdorferi.

Cell reports·2026
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

This study addresses ordering genes in related species using reference genomes. A new algorithm efficiently finds the best gene order, crucial for comparative genomics and understanding genome evolution.

Area of Science:

  • Comparative genomics
  • Bioinformatics
  • Computational biology

Background:

  • Comparative genomics relies on ordered gene sequences (chromosomes).
  • Genetic mapping yields partial gene orders, hindering direct comparison.
  • Combining maps results in incomplete and unordered gene information.

Purpose of the Study:

  • To develop a method for ordering genes in one species (P) using a reference genome order (O) from a related species.
  • To find a gene order linearization of P that minimizes genomic distance to O.

Main Methods:

  • Proved NP-completeness for breakpoint and common interval distances.
  • Developed a dynamic programming algorithm for breakpoint distance, efficient for limited genetic maps.
  • Introduced a time-efficient greedy heuristic for general partial orders.

Related Experiment Videos

Main Results:

  • The dynamic programming algorithm is polynomial for partial orders from bounded genetic maps.
  • The greedy heuristic achieves solutions within 10% of optimal on simulated data.
  • Demonstrated applications in analyzing grass genomes.

Conclusions:

  • Efficient algorithms exist for ordering genes based on reference genomes.
  • The greedy heuristic provides a practical approach for complex comparative genomics.
  • This work facilitates deeper insights into genome evolution and structure.